Efficient Planarity Testing

Authors:
John Hopcroft;Robert Tarjan
Affiliations:
Department of Computer Science, Cornell University, Ithaca, New York;Department of Electrical Engineering, University of California, Berkeley, CA and Cornell University, Ithaca, New York
Venue:
Journal of the ACM (JACM)
Year:
1974

Citing 4
Cited 181

Backtrack Programming

Journal of the ACM (JACM)
Algorithm 447: efficient algorithms for graph manipulation

Communications of the ACM
ALGOL W reference manual

ALGOL W reference manual
Problem-Solving Methods in Artificial Intelligence

Problem-Solving Methods in Artificial Intelligence

Establishing order in planar subdivisions

SCG '87 Proceedings of the third annual symposium on Computational geometry
Finding a maximum-genus graph imbedding

Journal of the ACM (JACM)
Small sets supporting fary embeddings of planar graphs

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Hierarchical planarity testing algorithms

Journal of the ACM (JACM)
An efficient parallel algorithm for computing a large independent set in a plan graph

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Area requirement and symmetry display in drawing graphs

SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Crossing Minimization in Linear Embeddings of Graphs

IEEE Transactions on Computers
Planar graph decomposition and all pairs shortest paths

Journal of the ACM (JACM)
An efficient algorithm for the genus problem with explicit construction of forbidden subgraphs

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
On upward drawing testing of triconnected digraphs (extended abstract)

SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Towards the Automatic Generation of Software Diagrams

IEEE Transactions on Software Engineering
Upward planar drawing of single source acyclic digraphs

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Fully dynamic planarity testing (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Biconnectivity approximations and graph carvings

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Structural and behavioral equivalence of simulation models

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Sequential and parallel algorithms to find a K5 minor

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Minimizing External Wires in Generalized Single-Row Routing

IEEE Transactions on Computers
Hierarchical pitchmatching compaction using minimum design

DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Approximation algorithms for NP-complete problems on planar graphs

Journal of the ACM (JACM)
Planarity testing in parallel

Proceedings of the 30th IEEE symposium on Foundations of computer science
Alpha-algorithms for incremental planarity testing (preliminary version)

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A shortest path approach to wireframe to solid model conversion

SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
Convex drawings of graphs in two and three dimensions (preliminary version)

Proceedings of the twelfth annual symposium on Computational geometry
Embedding graphs in an arbitrary surface in linear time

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On floorplans of planar graphs

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A layout approach to monolithic microwave IC

ISPD '98 Proceedings of the 1998 international symposium on Physical design
Drawing planar partitions I: LL-drawings and LH-drawings

Proceedings of the fourteenth annual symposium on Computational geometry
Fast algorithm for optimal layer assignment

DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Automatic building of graphs for rectangular dualisation

DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Fully dynamic planarity testing with applications

Journal of the ACM (JACM)
The computational complexity of knot and link problems

Journal of the ACM (JACM)
An analysis of some heuristics for the maximum planar subgraph problem

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Practical toroidality testing

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for Petersen's matching theorem

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
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
Generation of layouts from MOS circuit schematics: a graph theoretic approach

DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference
Maintenance of a minimum spanning forest in a dynamic planar graph

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph

Journal of the ACM (JACM)
A Linear Time Planarity Algorithm for 2-Complexes

Journal of the ACM (JACM)
A Polynomial Solution to the Undirected Two Paths Problem

Journal of the ACM (JACM)
Symmetric Complementation

Journal of the ACM (JACM)
Depth-First Search and Kuratowski Subgraphs

Journal of the ACM (JACM)
Algorithm 797: Fortran subroutines for approximate solution of graph planarization problems using GRASP

ACM Transactions on Mathematical Software (TOMS)
Computing crossing numbers in quadratic time

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Map graphs

Journal of the ACM (JACM)
I/O-optimal algorithms for planar graphs using separators

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Architecture-by-yourself: an experiment with computer graphics for house design

SIGGRAPH '76 Proceedings of the 3rd annual conference on Computer graphics and interactive techniques
Drawing database schemas

Software—Practice & Experience
Sewing ribbons on graphs in space

Journal of Combinatorial Theory Series B
Graph Visualization and Navigation in Information Visualization: A Survey

IEEE Transactions on Visualization and Computer Graphics
Parametric Graph Drawing

IEEE Transactions on Software Engineering
Algorithms and Complexity for Tetrahedralization Detections

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Simultaneous Embedding of a Planar Graph and Its Dual on the Grid

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Rectangle Visibility Graphs: Characterization, Construction, and Compaction

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
The Complexity of Planarity Testing

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Layered Drawings of Graphs with Crossing Constraints

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Planar Polyline Drawings with Good Angular Resolution

GD '98 Proceedings of the 6th International Symposium on Graph Drawing
A Framework for Drawing Planar Graphs with Curves and Polylines

GD '98 Proceedings of the 6th International Symposium on Graph Drawing
A Linear Time Implementation of SPQR-Trees

GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Minimum Depth Graph Embedding

ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Planar minimally rigid graphs and pseudo-triangulations

Proceedings of the nineteenth annual symposium on Computational geometry
Graph-based generation of referring expressions

Computational Linguistics
Symmetric complementation

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Linear algorithms to recognize interval graphs and test for the consecutive ones property

STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
An efficient algorithm for determining whether a cubic graph is toroidal

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
On determining the genus of a graph in O(v O(g)) steps(Preliminary Report)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Isomorphism for graphs embeddable on the projective plane

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Isomorphism testing for graphs of bounded genus

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
On the pagenumber of planar graphs

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A fast algorithm to test planar topological routability

VLSID '95 Proceedings of the 8th International Conference on VLSI Design
Planar domination graphs

Discrete Mathematics
The reliable algorithmic software challenge RASC

Computer Science in Perspective
The complexity of planarity testing

Information and Computation
A simple recognition of maximal planar graphs

Information Processing Letters
Computing crossing numbers in quadratic time

Journal of Computer and System Sciences - STOC 2001
Detecting tetrahedralizations of a set of line segments

Journal of Algorithms
Automatic layout of UML class diagrams in orthogonal style

Information Visualization - Special issue: Software visualization
2-Restricted extensions of partial embeddings of graphs

European Journal of Combinatorics - Special issue: Topological graph theory II
Heuristics for the Maximum Outerplanar Subgraph Problem

Journal of Heuristics
Certifying and constructing minimally rigid graphs in the plane

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Planar minimally rigid graphs and pseudo-triangulations

Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
A simulated annealing algorithm for determining the thickness of a graph

Information Sciences—Informatics and Computer Science: An International Journal
A 3-approximation for the pathwidth of Halin graphs

Journal of Discrete Algorithms
Classes of cycle bases

Discrete Applied Mathematics
Computing crossing number in linear time

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Reducing the Number of Fitness Evaluations in Graph Genetic Programming Using a Canonical Graph Indexed Database

Evolutionary Computation
Maximum matching in graphs with an excluded minor

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A linear work, O(n1/6) time, parallel algorithm for solving planar Laplacians

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Half integral packing, Erdős-Posá-property and graph minors

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
An Improved Algorithm for Testing the Planarity of a Graph

IEEE Transactions on Computers
Greedy drawings of triangulations

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Planar graph bipartization in linear time

Discrete Applied Mathematics
A graphical criterion of planarity for RNA secondary structures with pseudoknots in Rivas–Eddy class

Theoretical Computer Science
Every minor-closed property of sparse graphs is testable

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Graph and map isomorphism and all polyhedral embeddings in linear time

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree

CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Two new approximation algorithms for the maximum planar subgraph problem

Acta Cybernetica
Parameterized Graph Cleaning Problems

Graph-Theoretic Concepts in Computer Science
Clustered Planarity: Clusters with Few Outgoing Edges

Graph Drawing
A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks

Information Processing Letters
Hadwiger's conjecture is decidable

Proceedings of the forty-first annual ACM symposium on Theory of computing
Untangling Tanglegrams: Comparing Trees by Their Drawings

ISBRA '09 Proceedings of the 5th International Symposium on Bioinformatics Research and Applications
An O(n log n) approximation scheme for Steiner tree in planar graphs

ACM Transactions on Algorithms (TALG)
Simultaneous scheduling and location (ScheLoc): the planar ScheLoc makespan problem

Journal of Scheduling
Parameterized graph cleaning problems

Discrete Applied Mathematics
LR-upward drawing of ordered sets

Machine Graphics & Vision International Journal
Planar minimally rigid graphs and pseudo-triangulations

Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Determining the three-dimensional convex hull of a polyhedron

IBM Journal of Research and Development
Interactive web environment for collaborative and extensible diagram based learning

Computers in Human Behavior
A simulated annealing algorithm for determining the thickness of a graph

Information Sciences: an International Journal
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences
Planarity testing and optimal edge insertion with embedding constraints

GD'06 Proceedings of the 14th international conference on Graph drawing
Partitioned drawings

GD'06 Proceedings of the 14th international conference on Graph drawing
A generic program for minimal subsets with applications

LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Obtaining a planar graph by vertex deletion

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Fast digital signature algorithm based on subgraph isomorphism

CANS'07 Proceedings of the 6th international conference on Cryptology and network security
Cyclic level planarity testing and embedding

GD'07 Proceedings of the 15th international conference on Graph drawing
Efficient extraction of multiple kuratowski subdivisions

GD'07 Proceedings of the 15th international conference on Graph drawing
Untangling a planar graph

SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Note: A simple algorithm for 4-coloring 3-colorable planar graphs

Theoretical Computer Science
Exploiting qualitative spatial constraints for multi-hypothesis topological map learning

COSIT'09 Proceedings of the 9th international conference on Spatial information theory
Linkless and flat embeddings in 3-space and the unknot problem

Proceedings of the twenty-sixth annual symposium on Computational geometry
Steinitz theorems for orthogonal polyhedra

Proceedings of the twenty-sixth annual symposium on Computational geometry
Testing planarity of partially embedded graphs

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Terrain guarding is NP-hard

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Metamodel matching based on planar graph edit distance

ICMT'10 Proceedings of the Third international conference on Theory and practice of model transformations
Approximation algorithms for the capacitated domination problem

FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Basic graph algorithms

Algorithms and theory of computation handbook
Counting minimum (s, t)-cuts in weighted planar graphs in polynomial time

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Algorithm engineering: bridging the gap between algorithm theory and practice

Algorithm engineering: bridging the gap between algorithm theory and practice
Untangling Tanglegrams: Comparing Trees by Their Drawings

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Errors in graph embedding algorithms

Journal of Computer and System Sciences
Complexity results for the spanning tree congestion problem

WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree

Discrete Applied Mathematics
A computational approach to Conway's thrackle conjecture

GD'10 Proceedings of the 18th international conference on Graph drawing
On touching triangle graphs

GD'10 Proceedings of the 18th international conference on Graph drawing
A computational approach to Conway's thrackle conjecture

Computational Geometry: Theory and Applications
Blocks of hypergraphs: applied to hypergraphs and outerplanarity

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
An algorithm for the graph crossing number problem

Proceedings of the forty-third annual ACM symposium on Theory of computing
How to cut a graph into many pieces

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Planarity testing revisited

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Classical approximation schemes for the ground-state energy of quantum and classical ising spin hamiltonians on planar graphs

Quantum Information & Computation
A satisfiability-based approach for embedding generalized tanglegrams on level graphs

SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Terrain Guarding is NP-Hard

SIAM Journal on Computing
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On graph isomorphism for restricted graph classes

CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Exact crossing minimization

GD'05 Proceedings of the 13th international conference on Graph Drawing
C-planarity of extrovert clustered graphs

GD'05 Proceedings of the 13th international conference on Graph Drawing
Non-planar core reduction of graphs

GD'05 Proceedings of the 13th international conference on Graph Drawing
Minimum depth graph embeddings and quality of the drawings: an experimental analysis

GD'05 Proceedings of the 13th international conference on Graph Drawing
Trémaux trees and planarity

European Journal of Combinatorics
1-planarity of complete multipartite graphs

Discrete Applied Mathematics
Counting and sampling minimum (s,t)-cuts in weighted planar graphs in polynomial time

Theoretical Computer Science
Enumerating homomorphisms

Journal of Computer and System Sciences
A linear time algorithm for finding a maximal planar subgraph based on PC-trees

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Optimal polygonal representation of planar graphs

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
On graph crossing number and edge planarization

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Additional PC-Tree planarity conditions

GD'04 Proceedings of the 12th international conference on Graph Drawing
Simultaneous embedding of planar graphs with few bends

GD'04 Proceedings of the 12th international conference on Graph Drawing
On minimizing the number of label transitions around a vertex of a planar graph

IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
An effective ant colony algorithm for graph planarization problem

ICIC'11 Proceedings of the 7th international conference on Intelligent Computing: bio-inspired computing and applications
On the complexity of the edge-disjoint min-min problem in planar digraphs

Theoretical Computer Science
Survey: Certifying algorithms

Computer Science Review
A branch-and-cut approach to the crossing number problem

Discrete Optimization
Generalized k-ary tanglegrams on level graphs: A satisfiability-based approach and its evaluation

Discrete Applied Mathematics
The vulcan game of kal-toh: finding or making triconnected planar subgraphs

FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Tractable triangles and cross-free convexity in discrete optimisation

Journal of Artificial Intelligence Research
On the complexity of metric dimension

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
MSOL restricted contractibility to planar graphs

IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Centrality based visualization of small world graphs

EuroVis'08 Proceedings of the 10th Joint Eurographics / IEEE - VGTC conference on Visualization
Shrinking the search space for clustered planarity

GD'12 Proceedings of the 20th international conference on Graph Drawing
Toward a theory of planarity: hanani-tutte and planarity variants

GD'12 Proceedings of the 20th international conference on Graph Drawing
Upward planarity testing via SAT

GD'12 Proceedings of the 20th international conference on Graph Drawing
Note: Towards optimal kernel for connected vertex cover in planar graphs

Discrete Applied Mathematics
A quasi-polynomial time partition oracle for graphs with an excluded minor

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Dimension and height for posets with planar cover graphs

European Journal of Combinatorics
A note on the complexity of matching patterns with variables

Information Processing Letters
Crossing-constrained hierarchical drawings

Journal of Discrete Algorithms
Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
A linear time layout algorithm for business process models

Journal of Visual Languages and Computing

Quantified Score

Hi-index	0.02

Visualization

Abstract

This paper describes an efficient algorithm to determine whether an arbitrary graph G can be embedded in the plane. The algorithm may be viewed as an iterative version of a method originally proposed by Auslander and Parter and correctly formulated by Goldstein. The algorithm used depth-first search and has O(V) time and space bounds, where V is the number of vertices in G. An ALGOL implementation of the algorithm succesfully tested graphs with as many as 900 vertices in less than 12 seconds.