Efficient Planarity Testing

Journal of the ACM (JACM)

Volumn 21, Issue 4, 1974, Pages 549-568

  Hopcroft, John ^a   Tarjan, Robert ^a,b  

^a Cornell University ^*  (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - SUBROUTINES;

MATHEMATICAL TECHNIQUES;

EID: 0016117886     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/321850.321852     Document Type: Article

References (43)

1. Auslander, L., and Parter, S. V. On imbedding graphs in the plane. J. Math, and Mech. 10, 3 (May 1961), 517-523.
2. Goldstein, A. J. An efficient and constructive algorithm for testing whether a graph can be embedded in a plane. Graph and Combinatorics Conf., Contract No. NONR 1858-(21), Office of Naval Research Logistics Proj., Dep. of Math., Princeton U., May 16-18, 1963, 2 pp.
3. Golomb, S. W., and Baumert, L. D. Backtrack programming. J. ACM 12, 4 (Oct. 1965), 516-524.
4. Nilsson, N. Problem-Solving Methods in Artificial Intelligence. McGraw-Hill, New York, 1971.
5. Hopcroft, J., and Tarjan, R. Efficient algorithms for graph manipulation. Comm. ACM 16, 6 (June 1973), 372-378.
6. Tarjan, R. Depth-first search and linear graph algorithms. SIAM J. Comput. 1, 2 (June 1972), 146-159.
7. Hopcroft, J., and Tarjan, R. Isomorphism of planar graphs. In Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds., Plenum Press, New York, 1972, pp. 143-150.
8. Hopcroft, J., and Tarjan, R. Dividing a graph into triconnected components. SIAM J. Comput. 2, 3 (Sept. 1973), 135-158.
9. Tarjan, R. Finding dominators in directed graphs. Cornell U., Ithaca, N.Y., Dec. 1972 (unpub.).
10. Hecht, M. S., and Ullman, J. D. Flow-graph reducibility. SIAM J. Comput. 1, 2 (June 1972), 188-202.
11. Tarjan, R. Testing flow graph reducibility. TR 73-159, Dep. of Comput. Sci., Cornell U., Ithaca, N.Y., Dec. 1972.
12. Cook, S. Linear time simulation of deterministic two-way pushdown automata. Proc. IFIP Cong. 1971: Foundations of Information Processing, Ljubljana, Yugoslavia, Aug. 1971, North-Holland Pub. Co., Amsterdam, pp. 174-179.
13. Sites, R. L. Algol W., reference manual. STAN-CS-71-230, Comput. Sci. Dep., Stanford U., Aug. 1971.
14. Lederberg, J. DENDRAL-64: A system for computer construction, enumeration, and notation of organic molecules as tree structures and cyclic graphs, Part II: Topology of cyclic graphs. Interim Rep. to NASA, Grants Nos. G 81-60, NASA CR 68898, STAR No. N-66-14074, Dec. 15, 1965.
15. Hopcroft, J. Annlog nalgorithm for isomorphism of planar triply connected graphs. In Theory of Machines and Computations, Z. Kohavi and A. Paz, Eds., Academic Press, New York, 1971, pp. 189-196.
16. Hopcroft, J., and Tarjan, R. A V2algorithm for determining isomorphism of planar graphs. Inform. Processing Letters, 1, 1 (1971), 32-34.
17. Hopcroft, J., and Tarjan, R. An n log n algorithm for isomorphism of triconnected planar graphs. J. Comput. Syst. Sci. 7, 3 (June 1973), 323-331.
18. Weinberg, L. Plane representations and codes for planar graphs. Proceedings: Third Annual Allerton Conference on Circuit and System Theory, U. of Illinois, Monticello, Ill., Oct. 1965, pp. 733-744.
19. Weinberg, L. Algorithms for determining isomorphism groups for planar graphs. Proceedings: Third Annual Allerton Conference on Circuit and System Theory, U. of Illinois, Monticello, Ill., Oct. 1965, pp. 913-929.
20. Weinberg, L. A simple and efficient algorithm for determining isomorphism of planar triply connected graphs. IEEE Trans. on Circuit Theory CT-13, 2 (June 1966), 142-148.
21. Bruno, J., Steiglitz, K., and Weinberg, L. A new planarity test based on 3-connectivity. IEEE Trans. on Circuit Theory CT-17, 2 (May 1970), 197-206.
22. Chung, S. H., and Roe, P. H. Algorithms for testing the planarity of a graph. Proc. Thirteenth Midwest Symposium on Circuit Theory, U. of Minnesota, Minneapolis, Minn., May 1970, VII.4.1-VII.4.12.
23. Fisher, G. J. Computer recognition and extraction of planar graphs from the incidence matrix. IEEE Trans. on Circuit Theory CT-13, 2 (June 1966), 154-163.
24. Hopcroft, J., and Tarjan, R. Planarity testing in Vlog Vsteps: Extended abstract. Proc. IFIP Cong. 1971: Foundations of Information Processing, Ljubljana, Yugoslavia, Aug. 1971, North-Holland Pub. Co., Amsterdam, pp. 18-22.
25. Lempel, A., Even, S., and Cederbaum, I. An algorithm for planarity testing of graphs. Theory of Graphs: International Symposium: Rome, July, 1966.P. Rosenstiehl, Ed., Gordon and Breach, New York, 1967, pp. 215-232.
26. Mei, P., and Gibbs, N. A planarity algorithm based on the Kuratowski Theorem. Proc. AFIPS 1970 SJCC, Vol. 36, AFIPS Press, Montvale, N.J., pp. 91-95.
27. Mondshein, L. Combinatorial orderings and embedding of graphs. Tech. Note 1971-35, Lincoln Lab., M.I.T., Aug. 1971.
28. Shirey, R. W. Implementation and analysis of efficient graph planarity testing algorithms. Ph.D. Thesis, U. of Wisconsin, June 1969.
29. Tarjan, R. An efficient planarity algorithm. STAN-CS-244-71, Comput. Sci. Dep., Stanford U., Nov. 1971.
30. Tutte, W. J. How to draw a graph. Proc. London Math. Soc., Series 3, 13 (1963), 743-768.
31. Wing, O. On drawing a planar graph. IEEE Trans. on Circuit Theory CT-13, 1 (March 1966), 112-114.
32. Youngs, J. W. T. Minimal imbeddings and the genus of a graph. J. Math. and Mech. 12, 2 (1963), 305-315.
33. Kuratowski, C. Sur le probleme des corbes gauches en topologie. Fundamenta Mathematicae 15(1930), 271-283.
34. Tarjan, R. Implementation of an efficient algorithm for planarity testing of graphs. Dec. 1969 (unpublished).
35. Berge, C. The Theory of Graphs and Its Applications, trans, by Alision Doig. Methuen, London, 1964.
36. Busacker, R., and Saaty, T. Finite Graphs and Networks: An Introduction with Applications. McGraw-Hill, New York, 1965.
37. Harary, F. Graph Theory. Addison-Wesley, Reading, Mass., 1969.
38. Ore, O. Theory of Graphs. Amer. Math. Soc. Colloquium Pub., Vol. 38, Amer. Math. Soc., Providence, R. I., 1962.
39. Tutte, W. T. Connectivity in Graphs. Oxford U. Press, London, 1966.
40. Hall, D. W., and Spencer, G. Elementary Topology. Wiley, New York, 1955.
41. Thron, W. J. Introduction to the Theory of Functions of a Complex Variable. Wiley, New York, 1953.
42. Holt, R. C., and Reingold, E. M. On the time required to detect cycles and connectivity in directed graphs. TR 70-63, Dep. of Comput. Sci., Cornell U., June 1970.
43. Grace, D. W. Computer search for nonisomorphic convex polyhedra. Tech. Rep. CS15, Comput. Sci. Dep., Stanford U., Jan. 1965.