Affiliation:
1. Cornell Univ., Ithaca, NY
Abstract
Efficient algorithms are presented for partitioning a graph into connected components, biconnected components and simple paths. The algorithm for partitioning of a graph into simple paths of iterative and each iteration produces a new path between two vertices already on paths. (The start vertex can be specified dynamically.) If
V
is the number of vertices and
E
is the number of edges, each algorithm requires time and space proportional to max (
V, E
) when executed on a random access computer.
Publisher
Association for Computing Machinery (ACM)
Reference7 articles.
1. Computer Recognition and Extraction of Planar Graphs from the Incidence Matrix
2. Harary F. Graph Theory. Addison-Wesley Reading Mass. 1969. Harary F. Graph Theory. Addison-Wesley Reading Mass. 1969.
3. Holt R. and Reingold E. On the time required to detect cycles and connectivity in directed graphs. Comput. Sci. TR 70-33 Cornell U. Ithaca N.Y. Holt R. and Reingold E. On the time required to detect cycles and connectivity in directed graphs. Comput. Sci. TR 70-33 Cornell U. Ithaca N.Y.
4. Hopcroft J. and Tarjan R. Planarity testing in v log v steps extended abstract. Stanford U. CS 201 Mar. 1971. Hopcroft J. and Tarjan R. Planarity testing in v log v steps extended abstract. Stanford U. CS 201 Mar. 1971.
Cited by
663 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献