Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6746
Title: The Hopcroft-Tarjan Planarity Algorithm, Presentation and Improvements
Authors: Gries, David
Xue, Jinyun
Keywords: computer science
technical report
Issue Date: Apr-1988
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR88-906
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.
URI: http://hdl.handle.net/1813/6746
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
88-906.pdf1.99 MBAdobe PDFView/Open
88-906.ps473.59 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us