Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Depth-First Search and Kuratowski Subgraphs

Depth-First Search and Kuratowski Subgraphs Depth-First Search and Kuratowski Subgraphs S. G. W I L L I A M S O N 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( I V[ ) is shown. Categories and Subject Descriptors: F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems--complextty of proof procedures; computations on discrete structures General Terms: Algorithms Additional Key Words and Phrases: Nonplanar graphs, Kuratowski subgraphs, linear time algorithms 1. Introduction A number of efficient graph algorithms use the general method of depth-first search [3]. One of the deepest and most interesting of the depth-first search algorithms is the linear time planarity test of Hoperofi and Tarjan [2]. A classical result of Kuratowski (Theorem 1 below) states that, if G = (V, E) is nonplanar, then G contains a subgraph that is essentially (i.e., homeomorphic to) 1£3,3 (the complete bipartite graph based on the partition 3, 3) or K5 (the complete graph on 5 vertices). The basic depth-first search planarity test is not based on an explicit attempt to construct these residual nonplanar structures. In this paper http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of the ACM (JACM) Association for Computing Machinery

Depth-First Search and Kuratowski Subgraphs

Journal of the ACM (JACM) , Volume 31 (4) – Sep 20, 1984

Loading next page...
 
/lp/association-for-computing-machinery/depth-first-search-and-kuratowski-subgraphs-mh1eDZn2JX

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 1984 by ACM Inc.
ISSN
0004-5411
DOI
10.1145/1634.322451
Publisher site
See Article on Publisher Site

Abstract

Depth-First Search and Kuratowski Subgraphs S. G. W I L L I A M S O N 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( I V[ ) is shown. Categories and Subject Descriptors: F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems--complextty of proof procedures; computations on discrete structures General Terms: Algorithms Additional Key Words and Phrases: Nonplanar graphs, Kuratowski subgraphs, linear time algorithms 1. Introduction A number of efficient graph algorithms use the general method of depth-first search [3]. One of the deepest and most interesting of the depth-first search algorithms is the linear time planarity test of Hoperofi and Tarjan [2]. A classical result of Kuratowski (Theorem 1 below) states that, if G = (V, E) is nonplanar, then G contains a subgraph that is essentially (i.e., homeomorphic to) 1£3,3 (the complete bipartite graph based on the partition 3, 3) or K5 (the complete graph on 5 vertices). The basic depth-first search planarity test is not based on an explicit attempt to construct these residual nonplanar structures. In this paper

Journal

Journal of the ACM (JACM)Association for Computing Machinery

Published: Sep 20, 1984

There are no references for this article.