[PDF][PDF] Depth-first search and Kuratowski subgraphs
SG Williamson - Journal of the ACM (JACM), 1984 - dl.acm.org
SG Williamson
Journal of the ACM (JACM), 1984•dl.acm.orgDepth-First Search and Kuratowski Subgraphs Page 1 Depth-First Search and Kuratowski
Subgraphs SG WILLIAMSON Untverstty o/Californta, San Dtego, La Jolla, California Abstract.
Lel G = (V, E) be a nonplanar graph. The method of using depth-first techniques to extract a
Kuratowski .,;ubgraph in time O( IV[ ) is shown. Categories and Subject Descriptors: F.2.2 [Analysis
of Algorithms and Problem Complexity]: Nonnu- merical Algorithms and Problems--complextty
of proof procedures; computations on discrete structures General Terms: Algorithms Additional …
Subgraphs SG WILLIAMSON Untverstty o/Californta, San Dtego, La Jolla, California Abstract.
Lel G = (V, E) be a nonplanar graph. The method of using depth-first techniques to extract a
Kuratowski .,;ubgraph in time O( IV[ ) is shown. Categories and Subject Descriptors: F.2.2 [Analysis
of Algorithms and Problem Complexity]: Nonnu- merical Algorithms and Problems--complextty
of proof procedures; computations on discrete structures General Terms: Algorithms Additional …
Abstract
Lel G=(V, E) be a nonplanar graph. The method of using depth-first techniques to extract a Kuratowski.,; ubgraph in time O (IV [) is shown.
ACM Digital Library