论文信息 - Advances on C-Planarity Testing of Extrovert C-Graphs

Advances on C-Planarity Testing of Extrovert C-Graphs

The problem of testing c-planarity of cgraphs is unknown to be NP-complete or in P. Previous work solved this problem on some special classes of c-graphs. In particular, Goodrich, Lueker, and Sun tested c-planarity of extrovert c-graphs in O(n) time [5]. In this paper, we improve the time complexity of the testing algorithm in [5] to O(n).

Chaoyang Zhang | Jonathan Z. Sun

[1] Michael T. Goodrich,et al. C-Planarity of Extrovert Clustered Graphs , 2005, Graph Drawing.

[2] Michael Jünger,et al. Advances in C-Planarity Testing of Clustered Graphs , 2002, Graph Drawing.

[3] Robert E. Tarjan,et al. Efficient Planarity Testing , 1974, JACM.

[4] Thomas Lengauer,et al. Hierarchical planarity testing algorithms , 1989, JACM.

[5] Takao Nishizeki,et al. Planar Graphs: Theory and Algorithms , 1988 .

[6] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[7] Giuseppe Di Battista,et al. Clustering Cycles into Cycles of Clusters , 2005, J. Graph Algorithms Appl..

[8] Wen-Lian Hsu,et al. PC trees and circular-ones arrangements , 2003, Theor. Comput. Sci..

[9] Elias Dahlhaus,et al. A Linear Time Algorithm to Recognize Clustered Graphs and Its Parallelization , 1998, LATIN.