Abstract
A cycleC passing through two specific verticess andt of a biconnected graph is said to be anst-ambitus if its bridges do not interlace in some special way. We present algorithms forst-ambitus for planar biconnected graphs, which are much simpler than the one known for general graphs [MT]. Our algorithm runs inO(n) time on a sequential machine and (logn) parallel time usingO(n/logn) processors on an EREW PRAM.
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. Maheshwari. Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs.J. Algorithms, 9:507–537, 1988.
J. Edmonds. A combinatorial representation for polyhedral surfaces.Notices Amer. Math. Soc., 7:646, 1960.
H. Gazit. Optimal EREW parallel algorithms for connectivity, ear decomposition andst-numbering of planar graphs. Manuscript, Department of Computer Science, Duke University, Durham, NC 27706.
T. Hagerup. Optimal parallel algorithms on planar graphs.Proc. 3rd Aegean Workshop on Computing, Lecture Notes on Computer Science, Vol. 319. Springer-Verlag, Berlin, 1988, pp. 24–32.
D. Harel and R. E. Tarjan. Fast algorithm for finding nearest common ancestors.SIAM J. Comput., 13:338–355, 1984.
J. E. Hopcroft and R. E. Tarjan. Efficient planarity testing.J. Assoc. Comput. Mach., 21:549–568, 1974.
J. Jaja.An Introduction to Parallel Algorithms. Addison-Wesley, Reading, MA, 1992.
R. M. Karp and V. Ramachandran. Parallel algorithms for shared-memory machines. InAlgorithms and Complexity, Handbook of Theoretical Computer Science, Vol. A, 1990, pp. 869–941.
G. S. Krishna and C. P. Rangan. Optimal parallel algorithm for path problems on planar graphs.Theoret. Comput. Sci., to appear.
B. Mishra. An efficient algorithm to find all “bidirectional” edges of an undirected graph.Proc. 25th Ann. lEEE Symp. on Foundations of Computer Science, 1984, pp. 207–216.
B. Mishra. Some Graph Theoretic Issues in VLSI Design. Ph.D. thesis, Carnegie-Mellon University, September 1985.
B. Mishra and R. E. Tarjan. A linear-time algorithm for finding an ambitus.Algorithmica, 7:521–554, 1992.
V. Ramachandran and J. Reif. An optimal parallel algorithm for graph planarity.Proc. 30th Ann. IEEE Symp. on Foundations of Computer Science, 1989, pp. 282–287.
R. Sundar. Finding the Abiding Path and Its Applications to Graph Algorithms. B. Tech. Thesis, Department of Computer Science and Engineering, Indian Institute of Technology, Madras, 1987.
A. T. White.Graphs, Groups, and Surfaces. North-Holland, Amsterdam, 1973.
Author information
Authors and Affiliations
Additional information
Communicated by G. N. Fredrickson.
Rights and permissions
About this article
Cite this article
Easwarakumar, K.S., Krishnan, S.V., Rangan, C.P. et al. Optimal parallel algorithm for findingst-ambitus of a planar biconnected graph. Algorithmica 15, 242–255 (1996). https://doi.org/10.1007/BF01975868
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01975868