Abstract
We devise a linear-time algorithm for finding an ambitus ín an undirected graph. An ambitus is a cycle in a graph containing two distinguished vertices such that certain different groups of bridges (calledB itp-,B itQ-, andB itPQ-bridges) satisfy the property that a bridge in one group does not interlace with any bridge in the other groups. Thus, an ambitus allows the graph to be cut into pieces, where, in each piece, certain graph properties may be investigated independently and recursively, and then the pieces can be pasted together to yield information about these graph properties in the original graph. In order to achieve a good time-complexity for such an algorithm employing the divide-and-conquer paradigm, it is necessary to find an ambitus quickly. We also show that, using ambitus, linear-time algorithms can be devised for abiding-path-finding and nonseparating-induced-cycle-finding problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Cheriyan and S. N. Maheswari. Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected graphs.Journal of Algorithms, 9:507–537, 1988.
J. Hopcroft and R. Tarjan. Dividing a Graph into Triconnected Components.SIAM Journal of Computing, 2:135–158, September 1973.
J. Hopcroft and R. Tarjan. Efficient Planarity Testing.Journal of the Association for Computing Machinery, 21:549–568, October 1974.
S. V. Krishnan, C. Pandu Rangan, and S. Seshadri. A Simple Linear Algorithm for Finding the Ambitus in a Planar Graph. Technical Report, Department of Computer Science, Indian Institute of Technology, Madras, March 1988.
B. Mishra. An Efficient Algorithm To Find All “Bidirectional” Edges of an Undirected Graph.Proceedings of the 25th Annual Symposium on Foundations of Computer Science, pages 207–216, 1984.
B. Mishra. Some Graph Theoretic Issues in VLSI Design. Ph.D. thesis, Carnegie-Mellon University, September 1985.
T. Ohtsuki.The Two Disjoint Path Problem and Wire Routing Design. Graph Theory and Algorithms (Eds. N. Saito, T. Nishizeki). Springer-Verlag, Berlin, October 1980.
O. Ore.The Four-Color Problem. Academic Press, New York, 1967.
H. Sachs.Einführung in die Theorie der endlichen Graphen. Teubner, Leipzig, 1972.
R. Sundar. Finding the Abiding Path and Its Applications to Graph Algorithms. Technical Report, Department of Computer Science and Engineering, Indian Institute of Technology, Madras, June 1987.
R. Tarjan. Depth-First Search and Linear Graph Algorithms.SIAM Journal of Computing, 1(2): 146–160, June 1972.
W. T. Tutte.Connectivity in Graphs. University of Toronto Press, Toronto, 1966.
W. T. Tutte. Bridges and Hamiltonian Circuits in Planar Graphs.Aequationes Mathematicae, 15:1–33, 1977.
Author information
Authors and Affiliations
Additional information
Communicated by Greg N. Frederickson.
The research of B. Mishra was supported in part by National Science Foundation Grants DMS-8703458 and CCR-9002819. R. E. Tarjan's research at Princeton University was partially supported by DIMACS, a National Science Foundation Science and Technology Center, Grant No. NSF-STC88-09648, and by National Science Foundation Grant CCR-8929505.
Rights and permissions
About this article
Cite this article
Mishra, B., Tarjan, R.E. A linear-time algorithm for finding an ambitus. Algorithmica 7, 521–554 (1992). https://doi.org/10.1007/BF01758776
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01758776