Abstract
An algorithm proposed by Dinic for finding maximum flows in networks and by Hopcroft and Karp for finding maximum bipartite matchings is applied to graph connectivity problems. It is shown that the algorithm requires 0(V1/2E) time to find a maximum set of node-disjoint paths in a graph, and 0(V2/3E) time to find a maximum set of edge disjoint paths. These bounds are tight. Thus the node connectivity of a graph may be tested in 0(V5/2E) time, and the edge connectivity of a graph may be tested in 0(V5/3E) time.
Author supplied keywords
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Cite
CITATION STYLE
Endre Tarjan, R. (1974). Testing graph connectivity. In Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 185–193). Association for Computing Machinery. https://doi.org/10.1145/800119.803897
Readers over time
Readers' Seniority
Readers' Discipline
