A linear-time algorithm for four-partitioning four-connected planar graphs
Authors:
- Shin-Ichi NakanoSNShin-Ichi Nakano
- Md.Saidur RahmanMRMd.Saidur Rahman
- Takao NishizekiTNTakao Nishizeki
- 27 June 1997
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 62 (6) , 315-322
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Generalized guarding and partitioning for rectilinear polygonsComputational Geometry, 1996
- AnO(k 2n2) algorithm to find ak-partition in ak-connected graphJournal of Computer Science and Technology, 1994
- A linear algorithm for bipartition of biconnected graphsInformation Processing Letters, 1990
- On the complexity of partitioning graphs into connected subgraphsDiscrete Applied Mathematics, 1985
- A homology theory for spanning tress of a graphActa Mathematica Hungarica, 1977