{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T05:43:28Z","timestamp":1735883008395,"version":"3.32.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"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":[[1996,3]]},"DOI":"10.1007\/bf01975868","type":"journal-article","created":{"date-parts":[[2005,7,31]],"date-time":"2005-07-31T16:17:33Z","timestamp":1122826653000},"page":"242-255","source":"Crossref","is-referenced-by-count":0,"title":["Optimal parallel algorithm for findingst-ambitus of a planar biconnected graph"],"prefix":"10.1007","volume":"15","author":[{"given":"K. S.","family":"Easwarakumar","sequence":"first","affiliation":[]},{"given":"S. V.","family":"Krishnan","sequence":"additional","affiliation":[]},{"given":"C. Pandu","family":"Rangan","sequence":"additional","affiliation":[]},{"given":"S.","family":"Seshadri","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01975868_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. Maheshwari. Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs.J. Algorithms, 9:507\u2013537, 1988.","journal-title":"J. Algorithms"},{"key":"BF01975868_CR2","first-page":"646","volume":"7","author":"J. Edmonds","year":"1960","unstructured":"J. Edmonds. A combinatorial representation for polyhedral surfaces.Notices Amer. Math. Soc., 7:646, 1960.","journal-title":"Notices Amer. Math. Soc."},{"key":"BF01975868_CR3","unstructured":"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."},{"key":"BF01975868_CR4","series-title":"Lecture Notes on Computer Science, Vol. 319","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/BFb0040370","volume-title":"Proc. 3rd Aegean Workshop on Computing","author":"T. Hagerup","year":"1988","unstructured":"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\u201332."},{"key":"BF01975868_CR5","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"D. Harel and R. E. Tarjan. Fast algorithm for finding nearest common ancestors.SIAM J. Comput., 13:338\u2013355, 1984.","journal-title":"SIAM J. Comput."},{"key":"BF01975868_CR6","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. E. Hopcroft","year":"1974","unstructured":"J. E. Hopcroft and R. E. Tarjan. Efficient planarity testing.J. Assoc. Comput. Mach., 21:549\u2013568, 1974.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01975868_CR7","volume-title":"An Introduction to Parallel Algorithms","author":"J. Jaja","year":"1992","unstructured":"J. Jaja.An Introduction to Parallel Algorithms. Addison-Wesley, Reading, MA, 1992."},{"key":"BF01975868_CR8","first-page":"869","volume":"A","author":"R. M. Karp","year":"1990","unstructured":"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\u2013941.","journal-title":"Algorithms and Complexity, Handbook of Theoretical Computer Science"},{"key":"BF01975868_CR9","unstructured":"G. S. Krishna and C. P. Rangan. Optimal parallel algorithm for path problems on planar graphs.Theoret. Comput. Sci., to appear."},{"key":"BF01975868_CR10","doi-asserted-by":"crossref","unstructured":"B. Mishra. An efficient algorithm to find all \u201cbidirectional\u201d edges of an undirected graph.Proc. 25th Ann. lEEE Symp. on Foundations of Computer Science, 1984, pp. 207\u2013216.","DOI":"10.1109\/SFCS.1984.715917"},{"key":"BF01975868_CR11","unstructured":"B. Mishra. Some Graph Theoretic Issues in VLSI Design. Ph.D. thesis, Carnegie-Mellon University, September 1985."},{"key":"BF01975868_CR12","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/BF01758776","volume":"7","author":"B. Mishra","year":"1992","unstructured":"B. Mishra and R. E. Tarjan. A linear-time algorithm for finding an ambitus.Algorithmica, 7:521\u2013554, 1992.","journal-title":"Algorithmica"},{"key":"BF01975868_CR13","doi-asserted-by":"crossref","unstructured":"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\u2013287.","DOI":"10.1109\/SFCS.1989.63491"},{"key":"BF01975868_CR14","volume-title":"B. Tech. Thesis","author":"R. Sundar","year":"1987","unstructured":"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."},{"key":"BF01975868_CR15","volume-title":"Graphs, Groups, and Surfaces","author":"A. T. White","year":"1973","unstructured":"A. T. White.Graphs, Groups, and Surfaces. North-Holland, Amsterdam, 1973."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01975868.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01975868\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01975868","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T21:44:01Z","timestamp":1735854241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01975868"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["BF01975868"],"URL":"https:\/\/doi.org\/10.1007\/bf01975868","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}