A linear-time algorithm for four-partitioning four-connected planar graphs

Information Processing Letters

Volumn 62, Issue 6, 1997, Pages 315-322

  Nakano, Shin Ichi ^a   Rahman, Md Saidur ^a   Nishizeki, Takao ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

Algorithms; Canonical decomposition; Four connected planar graph; Graph partition; Linear time algorithms; St numbering

Indexed keywords

EID: 0003427962     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00083-5     Document Type: Article

References (13)

1. M.E. Dyer and A.M. Frieze, On the complexity of partitioning graphs into connected subgraphs, Discrete Appl. Math. 10 (1985) 139-153.
2. S. Even, Graph Algorithms (Computer Science Press, Potomac, MD, 1979).
3. E. Györi, On division of connected subgraphs, in: Proc. 5th Hungarian Combinational Coll. (1978) 485-494.
4. E. Györi, Private communication, March 21, 1996.
5. L. Jou, H. Suzuki and T. Nishizeki, A linear algorithm for finding a nonseparating ear decomposition of triconnected planar graphs, Tech. Kept. AL40-3, Information Processing Society of Japan, 1994.
6. G. Kant, A more compact visibility representation, in: Proc. 19th Internat. Workshop on Graph Theoretic Concepts in Computer Science (WG'93), Lecture Notes in Computer Science, Vol. 790 (Springer, Berlin, 1994) 411-424.
7. G. Kant and X. He, Two algorithms for finding rectangular duals of planar graphs, in: Proc. 19th Internat. Workshop on Graph Theoretic Concepts in Computer Science (WG'93), Lecture Notes in Computer Science, Vol. 790 (Springer, Berlin, 1994) 396-410.
8. L. Lovász, A homology theory for spanning trees of a graph, Acta Math. Acad. Sci. Hungar. 30 (1977) 241-251.
9. 2) algorithm to find a k-partition in a k-connected graph, J. Comput. Sci. Tech. 9 (1) (1994) 86-91.
10. H. Suzuki, N. Takahashi and T. Nishizeki, A linear algorithm for bipartition of biconnected graphs, Inform. Process. Lett. 33 (5) (1990) 227-232.
11. H. Suzuki, N. Takahashi, T. Nishizeki, H. Miyano and S. Ueno, An algorithm for tripartitioning 3-connected graphs, J. Inform. Process. Soc. Japan 31 (5) (1990) 584-592.
12. K. Wada and K. Kawaguchi, Efficient algorithms for triconnected graphs and 3-edge-connected graphs, in: Proc. 19th Internat. Workshop on Graph Theoretic Concepts in Computer Science (WG'93), Lecture Notes in Computer Science, Vol. 790 (Springer, Berlin, 1994) 132-143.
13. K. Wada, A. Takaki and K. Kawaguchi, Efficient algorithms for a mixed k-partition problem of graphs without specifying bases, in: Proc. 20th Internat. Workshop on Graph Theoretic Concepts in Computer Science (WG'94), Lecture Notes in Computer Science, Vol. 903 (Springer, Berlin, 1995) 319-330.