{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T19:10:02Z","timestamp":1735758602122,"version":"3.32.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1-6","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1992,6]]},"DOI":"10.1007\/bf01758776","type":"journal-article","created":{"date-parts":[[2005,6,15]],"date-time":"2005-06-15T10:49:08Z","timestamp":1118832548000},"page":"521-554","source":"Crossref","is-referenced-by-count":5,"title":["A linear-time algorithm for finding an ambitus"],"prefix":"10.1007","volume":"7","author":[{"given":"B.","family":"Mishra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. E.","family":"Tarjan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01758776_CR1","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/0196-6774(88)90015-6","volume":"9","author":"J. Cheriyan","year":"1988","unstructured":"J. Cheriyan and S. N. Maheswari. Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected graphs.Journal of Algorithms, 9:507\u2013537, 1988.","journal-title":"Journal of Algorithms"},{"key":"BF01758776_CR2","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J. Hopcroft","year":"1973","unstructured":"J. Hopcroft and R. Tarjan. Dividing a Graph into Triconnected Components.SIAM Journal of Computing, 2:135\u2013158, September 1973.","journal-title":"SIAM Journal of Computing"},{"key":"BF01758776_CR3","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"J. Hopcroft and R. Tarjan. Efficient Planarity Testing.Journal of the Association for Computing Machinery, 21:549\u2013568, October 1974.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"BF01758776_CR4","series-title":"Technical Report","volume-title":"A Simple Linear Algorithm for Finding the Ambitus in a Planar Graph","author":"S. V. Krishnan","year":"1988","unstructured":"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."},{"key":"BF01758776_CR5","doi-asserted-by":"crossref","unstructured":"B. Mishra. An Efficient Algorithm To Find All \u201cBidirectional\u201d Edges of an Undirected Graph.Proceedings of the 25th Annual Symposium on Foundations of Computer Science, pages 207\u2013216, 1984.","DOI":"10.1109\/SFCS.1984.715917"},{"key":"BF01758776_CR6","unstructured":"B. Mishra. Some Graph Theoretic Issues in VLSI Design. Ph.D. thesis, Carnegie-Mellon University, September 1985."},{"key":"BF01758776_CR7","volume-title":"The Two Disjoint Path Problem and Wire Routing Design. Graph Theory and Algorithms","author":"T. Ohtsuki","year":"1980","unstructured":"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."},{"key":"BF01758776_CR8","volume-title":"The Four-Color Problem","author":"O. Ore","year":"1967","unstructured":"O. Ore.The Four-Color Problem. Academic Press, New York, 1967."},{"key":"BF01758776_CR9","volume-title":"Einf\u00fchrung in die Theorie der endlichen Graphen","author":"H. Sachs","year":"1972","unstructured":"H. Sachs.Einf\u00fchrung in die Theorie der endlichen Graphen. Teubner, Leipzig, 1972."},{"key":"BF01758776_CR10","series-title":"Technical Report","volume-title":"Finding the Abiding Path and Its Applications to Graph Algorithms","author":"R. Sundar","year":"1987","unstructured":"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."},{"issue":"2","key":"BF01758776_CR11","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"R. Tarjan. Depth-First Search and Linear Graph Algorithms.SIAM Journal of Computing, 1(2): 146\u2013160, June 1972.","journal-title":"SIAM Journal of Computing"},{"key":"BF01758776_CR12","doi-asserted-by":"crossref","DOI":"10.3138\/9781487584863","volume-title":"Connectivity in Graphs","author":"W. T. Tutte","year":"1966","unstructured":"W. T. Tutte.Connectivity in Graphs. University of Toronto Press, Toronto, 1966."},{"key":"BF01758776_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01837870","volume":"15","author":"W. T. Tutte","year":"1977","unstructured":"W. T. Tutte. Bridges and Hamiltonian Circuits in Planar Graphs.Aequationes Mathematicae, 15:1\u201333, 1977.","journal-title":"Aequationes Mathematicae"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01758776.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01758776\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01758776","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T18:28:53Z","timestamp":1735756133000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01758776"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":13,"journal-issue":{"issue":"1-6","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["BF01758776"],"URL":"https:\/\/doi.org\/10.1007\/bf01758776","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}