Abstract
Three planarity algorithms PA-1, PA-2, and PA-3 are presented which are substantial improvements upon those of Demoucronet al. and Rubin, respectively. The algorithms test the planarity of a graphG by attempting to embed it into the plane step by step. If such an embedding can succeed,G is determined as planar and its planar representation is acquired simultaneously. Among others, PA-3 has been implemented in ALGOL on UNIVAC-1100. The program takes about 13.5 seconds to test a graph of 1000 vertices and 2994 edges.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Auslander, L. and Parter, S. V.,On imbedding graphs in the plane. J. Math. and Mech. 10, 3 (May 1961), 517–523.
Demoucron, G., Malgrange, Y. and Pertuiset, R.,Graphes planaires: Reconnaissance et construction des representations topologiques. Rev. Français de Rech. Operationelle, 8 (1964), 34–47.
Hopcroft, J. and Tarjan, R.,Efficient planarity testing. J. ACM, 21, 4 (October 1974), 549–568.
Rubin, F.,An improved algorithm for testing the planarity of a graph. IEEE Trans. on Computers, 24, 2 (1975), 113–121.
Yeh, D. S., A fast planarity algorithm, Chinese Journal of Computers 4.1 (Jan. 1981), 68–74.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Yeh, D. Improved planarity algorithms. BIT 22, 2–16 (1982). https://doi.org/10.1007/BF01934391
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01934391