Given a graph G=(V,E), five distinct vertices u1,u2,u3,u4,u5
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Sayaka NAGAI, Shin-ichi NAKANO, "A Linear-Time Algorithm for Five-Partitioning Five-Connected Internally Triangulated Plane Graphs" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 9, pp. 2330-2337, September 2001, doi: .
Abstract: Given a graph G=(V,E), five distinct vertices u1,u2,u3,u4,u5
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_9_2330/_p
Copy
@ARTICLE{e84-a_9_2330,
author={Sayaka NAGAI, Shin-ichi NAKANO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Linear-Time Algorithm for Five-Partitioning Five-Connected Internally Triangulated Plane Graphs},
year={2001},
volume={E84-A},
number={9},
pages={2330-2337},
abstract={Given a graph G=(V,E), five distinct vertices u1,u2,u3,u4,u5
keywords={},
doi={},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - A Linear-Time Algorithm for Five-Partitioning Five-Connected Internally Triangulated Plane Graphs
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2330
EP - 2337
AU - Sayaka NAGAI
AU - Shin-ichi NAKANO
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2001
AB - Given a graph G=(V,E), five distinct vertices u1,u2,u3,u4,u5
ER -