Additional PC-tree planarity conditions

Lecture Notes in Computer Science

Volumn 3383, Issue , 2004, Pages 82-88

  Boyer, John M ^a  

^a PureEdge Solutions Inc   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; DATA STRUCTURES; GRAPH THEORY; TREES (MATHEMATICS); ALGORITHMS; DRAWING (GRAPHICS); FORESTRY;

PC-TREE PLANARITY CONDITIONS; PLANAR GRAPHS; PLANARITY ALGORITHMS; PQ-TREE;

ALGORITHMS; TREES (MATHEMATICS);

PC-TREE PLANARITY CONDITIONS; PLANAR GRAPH; PLANARITY; PLANARITY ALGORITHMS; PQ-TREE; RECENT RESEARCHES; TREE DATA STRUCTURES;

EID: 24144496848     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. Hopcroft, J., Tarjan, R.: Efficient planarity testing. Journal of the Association for Computing Machinery 21 (1974) 549-568
2. Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and Systems Sciences 13 (1976) 335-379
3. Boyer, J., Myrvold, W.: Stop minding your P's and Q's: A simplified O(n) planar embedding algorithm. Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (1999) 140-146
4. Boyer, J., Myrvold, W.: On the cutting edge: Simplified O(n) planarity by edge addition. Accepted to Journal of Graph Algorithms and Applications, August 2004 (Preprint at http://www.pacificcoast.net/~lightning/planarity.ps) 1-29
5. Shih, W.K., Hsu, W.L.: A new planarity test. Theoretical Computer Science 223 (1999) 179-191
6. Hsu, W.L.: A simple test for the consecutive ones property. Journal of Algorithms 42 (2002) 1-16
7. Hsu, W.L., McConnell, R.: PC-trees and circular-ones arrangements. Theoretical Computer Science 296 (2003) 59-74
8. Hsu, W.L.: PC-trees vs. PQ-trees. Lecture Notes in Computer Science 2108 (2001) 207-217
9. Hsu, W.L., McConnell, R.: PC-trees, submitted to Handbook of Data Structures and Applications, Dinesh P Mehta and Sartaj Sahni ed. (2004)
10. Hsu, W.L.: An efficient implementation of the PC-trees algorithm of shih and hsu's planarity test. Technical Report TR-IIS-03-015, Institute of Information Science, Academia Sinica (2003)
11. Boyer, J.M., Cortese, P.F., Patrignani, M., Di Battista, G.: Stop minding your P's and Q's: Implementing a fast and simple DFS-based planarity testing and embedding algorithm. In Liotta, G., ed.: Proceedings of the 11th International Symposium on Graph Drawing 2003. Volume 2912 of Lecture Notes in Computer Science., Springer-Verlag (2004) 25-36
12. de Fraysseix, H., Rosenstiehl, P.: A characterization of planar graphs by trémaux orders. Combinatorica 5 (1985) 127-135