Efficient Planarity Testing
| dc.contributor.author | Hopcroft, John E. | en_US |
| dc.contributor.author | Tarjan, Robert Endre | en_US |
| dc.date.accessioned | 2007-04-19T19:03:03Z | |
| dc.date.available | 2007-04-19T19:03:03Z | |
| dc.date.issued | 1973-04 | en_US |
| dc.description.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 uses 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 successfully tested graphs with as many as 900 vertices in less than 12 seconds. | en_US |
| dc.format.extent | 2409135 bytes | |
| dc.format.extent | 1273475 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR73-165 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6011 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Efficient Planarity Testing | en_US |
| dc.type | technical report | en_US |