Thumbnail
Access Restriction
Subscribed

Author Hopcroft, John ♦ Tarjan, Robert
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1974
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract This paper describes an efficient algorithm to determine whether an arbitrary graph $\textit{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 $\textit{O}(\textit{V})$ time and space bounds, where $\textit{V}$ is the number of vertices in $\textit{G}.$ An ALGOL implementation of the algorithm succesfully tested graphs with as many as 900 vertices in less than 12 seconds.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1974-10-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 21
Issue Number 4
Page Count 20
Starting Page 549
Ending Page 568


Open content in new tab

   Open content in new tab
Source: ACM Digital Library