What is recorded here?
The1974publication organizes a planarity decision method around depth-first search,lowpoint-ordered paths and stack-managed placement constraints, with a linear time/space analysis in its stated adjacency-list random-access model. A network is planar if its edges can be drawn without crossings. Trying many drawings is expensive. Hopcroft and Tarjan organize the graph into paths, then use compact constraints to track which side of a cycle each piece can occupy. This lets the decision procedure avoid redoing the same placement work. The published decision test, its earlier experimental implementation and the later detailed drawing-construction algorithms are distinct parts of the history.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
Scientific scope
The original algorithm tests finite simple undirected graphs using adjacency lists, a bounded-word access model and biconnected-component reduction. Linear complexity does not mean reading a dense matrix in linear vertex time. The original test does not itself output a complete drawing/embedding. A bibliographically identified erratum has not been fully assessed, and pseudocode/transcription is not offered as certified runnable code.
Read the original work
- Hopcroft and Tarjan:Efficient Planarity Testing(1974), original549–568
- ACM:Efficient Planarity Testing publication metadata
- Mehlhorn/Mutzel:later detailed embedding phase, selected introduction only
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
John Hopcroft; Robert Tarjan
Source-listed contributors to this scoped work. Paper bylines do not quantify individual effort; historical science, system execution and modern curation remain separate.
Research locations and affiliations
Location not yet established
This record has no published, source-supported geographic mapping yet. Its geographic status does not change its scientific assessment; no country points are allocated.
English catalogue narrative
Hopcroft and Tarjan: deciding whether a network can lie in the plane
The1974publication organizes a planarity decision method around depth-first search,lowpoint-ordered paths and stack-managed placement constraints, with a linear time/space analysis in its stated adjacency-list random-access model.
A network is planar if its edges can be drawn without crossings. Trying many drawings is expensive. Hopcroft and Tarjan organize the graph into paths, then use compact constraints to track which side of a cycle each piece can occupy. This lets the decision procedure avoid redoing the same placement work. The published decision test, its earlier experimental implementation and the later detailed drawing-construction algorithms are distinct parts of the history.
Scientific scope
The original algorithm tests finite simple undirected graphs using adjacency lists, a bounded-word access model and biconnected-component reduction. Linear complexity does not mean reading a dense matrix in linear vertex time. The original test does not itself output a complete drawing/embedding. A bibliographically identified erratum has not been fully assessed, and pseudocode/transcription is not offered as certified runnable code.
People and systems
John Hopcroft; Robert Tarjan