On the cutting edge: Simplified O(n) planarity by edge addition

Journal of Graph Algorithms and Applications

Volumn 8, Issue 3, 2004, Pages 241-273

  Boyer, John M ^a   Myrvold, Wendy J ^b  

^a PureEdge Solutions Inc   (Canada)

^b UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY;

ADDITION METHOD; CONDITION; CUTTING EDGES; EDGE ADDITION; EMBEDDINGS; PATH TRAVERSALS; PLANAR EMBEDDINGS; PLANARITY; PQ-TREES; SUBGRAPHS;

TREES (MATHEMATICS);

EID: 24944486598     PISSN: 15261719     EISSN: 15261719     Source Type: Journal    
DOI: 10.7155/jgaa.00091     Document Type: Article

References (28)

1. K. S. Booth and G. S. Lueker. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and Systems Sciences, 13:335-379, 1976.
2. J. Boyer and W. Myrvold. 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, pages 140-146, 1999.
3. J. M. Boyer. Additional PC-tree planarity conditions. In J. Pach, editor, Proceedings of the 12th International Symposium on Graph Drawing 2004, to appear in Lecture Notes in Computer Science. Springer-Verlag, 2004.
4. J. M. Boyer, P. F. Cortese, M. Patrignani, and G. Di Battista. Stop minding your P's and Q's: Implementing a fast and simple DFS-based planarity testing and embedding algorithm. Technical Report RT-DIA-83-2003, Dipartimento di Informatica e Automazione, Universitá di Roma Tre, Nov. 2003.
5. J. M. Boyer, P. F. Cortese, M. Patrignani, and G. Di Battista. Stop minding your P's and Q's: Implementing a fast and simple DFS-based planarity testing and embedding algorithm. In G. Liotta, editor, Proceedings of the 11th International Symposium on Graph Drawing 2003, volume 2912 of Lecture Notes in Computer Science, pages 25-36. Springer-Verlag, 2004.
6. N. Chiba, T. Nishizeki, A. Abe, and T. Ozawa. A linear algorithm for embedding planar graphs using PQ-trees. Journal of Computer and Systems Sciences, 30:54-76, 1985.
7. H. de Fraysseix and P. Rosenstiehl. A characterization of planar graphs by trémaux orders. Combinatorica, 5(2):127-135, 1985.
8. N. Deo. Note on Hopcroft and Tarjan planarity algorithm. Journal of the Association for Computing Machinery, 23:74-75, 1976.
9. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Upper Saddle River, NJ, 1999.
10. S. Even and R. E. Tarjan. Computing an st-numbering. Theoretical Computer Science, 2:339-344, 1976.
11. A. Gibbons. Algorithmic Graph Theory. Cambridge University Press, 1985.
12. J. Hopcroft and R. Tarjan. Efficient planarity testing. Journal of the Association for Computing Machinery, 21(4):549-568, 1974.
13. W.-L. Hsu. 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, July 2003.
14. M. Jünger, S. Leipert, and P. Mutzel. Pitfalls of using PQ-trees in automatic graph drawing. In G. Di Battista, editor, Proceedings of the 5th International Symposium on Graph Drawing '97, volume 1353 of Lecture Notes in Computer Science, pages 193-204. Springer Verlag, Sept. 1997.
15. A. Lempel, S. Even, and I. Cederbaum. An algorithm for planarity testing of graphs. In P. Rosenstiehl, editor, Theory of Graphs, pages 215-232, New York, 1967. Gordon and Breach.
16. P. Lieby. Planar graphs. The Magma Computational Algebra System, http://magma.maths.usyd.edu.au/magma/htmlhelp/text1185.htm.
17. R. J. Lipton and R. E. Tarjan. Applications of a planar separator theorem. SIAM Journal of Computing, 9(3):615-627, 1980.
18. B. D. McKay. Practical graph isomorphism. Congressus Numerantium, 30:45-87, 1981.
19. K. Mehlhorn and P. Mutzel. On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm. Algorithmica, 16:233-242, 1996.
20. A. Noma. Análise experimental de algoritmos de planaridade. Master's thesis, Universidade de São Paulo, May 2003. in Portuguese.
21. E. M. Reingold, J. Nievergelt, and N. Deo. Combinatorial Algorithms: Theory and Practice. Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1977.
22. W.-K. Shih and W.-L. Hsu. A simple test for planar graphs. In Proceedings of the International Workshop on Discrete Mathematics and Algorithms, pages 110-122, 1993.
23. W.-K. Shih and W.-L. Hsu. A new planarity test. Theoretical Computer Science, 223:179-191, 1999.
24. R. E. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal of Computing, 1(2):146-160, 1972.
25. A.-M. Törsel. An implementation of the Boyer-Myrvold algorithm for embedding planar graphs. University of Applied Sciences Stralsund, Germany, 2003. Diploma thesis, in German.
26. D. B. West. Introduction to Graph Theory. Prentice Hall, Inc., Upper Saddle River, NJ, 1996.
27. S. G. Williamson. Embedding graphs in the plane- algorithmic aspects. Annals of Discrete Mathematics, 6:349-384, 1980.
28. S. G. Williamson. Combinatorics for Computer Science. Computer Science Press, Rockville, Maryland, 1985.