Planarity testing in V log V steps: extended abstract

Authors:
John E. Hopcroft;Robert E Tarjan
Affiliations:
-;-
Venue:
Planarity testing in V log V steps: extended abstract
Year:
1971

Citing 0
Cited 2

Algorithm 447: efficient algorithms for graph manipulation

Communications of the ACM
Subrecursive program schemata I & II(I. Undecidable equivalence problems, II. Decidable equivalence problems)

STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.02

Visualization

Abstract

An efficient algorithm is presented for determining whether or not a given graph is planar. If V is the number of vertices in the graph, the algorithm requires time proportional to V log V and space proportional to V when run on a random-access computer. The algorithm constructs the facial boundaries of a planar representation without backup, using extensive list-processing features to speed computation. The theoretical time bound improves on that of previously published algorithms. Experimental evidence indicates that graphs with a few thousand edges can be tested within seconds.