JavaScript is disabled for your browser. Some features of this site may not work without it.
The Hopcroft-Tarjan Planarity Algorithm, Presentation and Improvements

Author
Gries, David; Xue, Jinyun
Abstract
We give a rigorous, yet, we hope, readable, presentation of the Hopcroft-Tarjan linear algorithm for testing the planarity of a graph, using more modern principles and techniques for developing and presenting algorithms that have been developed in the past 10-12 years (their algorithm appeared in the early 1970's). Our algorithm not only tests planarity but also constructs a planar embedding, and in a fairly straightforward manner. The paper concludes with a short discussion of the advantages of our approach.
Date Issued
1988-04Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR88-906
Type
technical report