论文信息 - On the Cutting Edge: Simplified O(n) Planarity by Edge Addition

On the Cutting Edge: Simplified O(n) Planarity by Edge Addition

Recent research efforts have produced new algorithms for solving planarity-related problems. One such method performs vertex addition using the PC-tree data structure, which is similar to but simpler than the well-known PQ-tree. For each vertex, the PC-tree is first checked to see if the new vertex can be added without violating certain planarity conditions; if the conditions hold, the PC-tree is adjusted to add the new vertex and processing continues. The full set of planarity conditions are required for a PC-tree planarity tester to report only planar graphs as planar. This paper provides further analyses and new planarity conditions needed to produce a correct planarity algorithm with a PC-tree.

John M. Boyer | J. Boyer | Wendy J. Myrvold

[1] John M. Boyer,et al. Stop minding your p's and q's: a simplified O(n) planar embedding algorithm , 1999, SODA '99.

[2] Oscar H. Ibarra,et al. Generalized discrete timed automata: decidable approximations for safety verificatio , 2003, Theor. Comput. Sci..

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

[4] Hubert de Fraysseix,et al. A characterization of planar graphs by trémaux orders , 1985, Comb..

[5] Wei-Kuan Shih,et al. A New Planarity Test , 1999, Theor. Comput. Sci..

[6] Wen-Lian Hsu. A Simple Test for the Consecutive Ones Property , 2002, J. Algorithms.

[7] Sartaj Sahni,et al. Handbook of Data Structures and Applications , 2004 .

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

[9] John M. Boyer,et al. Stop Minding Your P's and Q's: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding Algorithm , 2003, GD.

[10] Ulrich Meyer,et al. Oblivious Gossiping on Tori , 2002, J. Algorithms.

[11] Wen-Lian Hsu. PC-Trees vs. PQ-Trees , 2001, COCOON.

[12] 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..