Bijective comparison of optimal planarity algorithms

References

• Booth , K. S. and Lueker , G. S. 1976 . Testing for the Consecutive Ones Property,Interval Graphs and Graph . J. Comput. System Sci. , 13 : 335 – 379 .
   Web of Science ®Google Scholar
• Canfield , E. R. and Williamson , S. G. 1990 . The Two Basic Linear Time Planarity Algorithms . Linear and Multilinear Algebra , 16 : 243 – 265 . Are They the Same?
   Google Scholar
• Hopcroft , J. E. and Tarjan , R. E. 1974 . Efficient planarity testing . J. Assoc. Comput. Mach. , 21 : 549 – 568 .
   Web of Science ®Google Scholar
• Lempel , A. , Even , S. and Cederbaum , I. 1967 . “ An Algorithm for Planarity Testing of Graphs in Theory of Graphs ” . In International Symposium: Rome , Edited by: Rosenstiel , P. 215 – 232 . New York : Gordon and Breach .
   Google Scholar
• Small , J. F. 1991 . A Unified Approach to Testing . Embedding and Drawing Planar Graphs , Ph.D Thesis, UCSD
   Google Scholar
• Tarjan , R. E. 1972 . Depth-First Search and Linear Graph Algorithms . SIAM J. Comput. , 1 : 146 – 160 .
   Google Scholar
• Williamson , S. G. 1980 . “ Embedding Graphs in the Plane—Algorithmic Aspects in Annals of Discrete Mathematics 6: ombinatorial Mathematics ” . In Optimal Designs and Their Applications Edited by: Srivastava , J. 349 – 384 . North Holland
   Google Scholar
• Williamson , S. G. 1985 . Combinatorics for Computer Science , Rockville, Md : Computer Science Press .
   Google Scholar
• Vo , K. P. , Dick , W. E. and Williamson , S. G. 1985 . Ranking and Unranking Planar Embeddings . Linear and Multilinear Algebra , 18 : 35 – 36 .
   Google Scholar