{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T23:17:52Z","timestamp":1648595872870},"reference-count":24,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6591,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1995,7]]},"DOI":"10.1016\/0304-3975(94)00189-p","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T10:09:04Z","timestamp":1051265344000},"page":"27-43","source":"Crossref","is-referenced-by-count":0,"title":["Optimal parallel algorithms for path problems on planar graphs"],"prefix":"10.1016","volume":"145","author":[{"given":"G.","family":"Srikrishna","sequence":"first","affiliation":[]},{"given":"C.Pandu","family":"Rangan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00189-P_BIB1","series-title":"Proc. AWOC","first-page":"81","article-title":"Deterministic parallel list ranking","volume":"Vol. 319","author":"Anderson","year":"1988"},{"key":"10.1016\/0304-3975(94)00189-P_BIB2","series-title":"Graph Theory with Applications","author":"Bondy","year":"1979"},{"key":"10.1016\/0304-3975(94)00189-P_BIB3","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","article-title":"Directed sub graph homeomorphism problem","volume":"10","author":"Fortune","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00189-P_BIB4","series-title":"Proc. 16th ICALP","first-page":"379","article-title":"Finding triconnected components by local replacements","volume":"Vol. 372","author":"Fussel","year":"1989"},{"key":"10.1016\/0304-3975(94)00189-P_BIB5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0890-5401(87)90062-9","article-title":"Towards optimal parallel bucket sorting","volume":"75","author":"Hagerup","year":"1975","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(94)00189-P_BIB6","series-title":"Proc. AWOC","first-page":"24","article-title":"Optimal parallel algorithms on planar graphs","volume":"Vol. 319","author":"Hagerup","year":"1988"},{"key":"10.1016\/0304-3975(94)00189-P_BIB7","series-title":"An Introduction to Parallel Algorithms","author":"Jaja","year":"1992"},{"key":"10.1016\/0304-3975(94)00189-P_BIB8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","article-title":"On computational complexity of combinatorial problems","volume":"5","author":"Karp","year":"1975","journal-title":"Networks"},{"key":"10.1016\/0304-3975(94)00189-P_BIB9","series-title":"Paths, flows and VLSI-layout","first-page":"266","volume":"9","year":"1990"},{"key":"10.1016\/0304-3975(94)00189-P_BIB10","series-title":"Proc. 30th FOCS","first-page":"300","article-title":"Processor efficient algorithms for the two disjoint paths problem and for finding a kurtowski's homeomorph","author":"Khuller","year":"1989"},{"key":"10.1016\/0304-3975(94)00189-P_BIB11","unstructured":"K.S. Easwarakumar, S.V. Krishnan, C. Pandu rangan and S. Seshadri, Optimal parallel algorithm for finding st-ambitus of a planar biconnected graph, Algorithmica, to appear."},{"key":"10.1016\/0304-3975(94)00189-P_BIB12","first-page":"869","article-title":"Parallel algorithms for shared memory machines","volume":"Vol. A","author":"Karp","year":"1990"},{"key":"10.1016\/0304-3975(94)00189-P_BIB13","series-title":"Proc. 30th FOCS","first-page":"288","article-title":"Efficient parallel algorithms for testing connectivity and finding disjoint s\u2013t paths","author":"Khuller","year":"1989"},{"key":"10.1016\/0304-3975(94)00189-P_BIB14","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/1061425.1061430","article-title":"The equivalence of theorem proving and interconnection problem","volume":"5","author":"Lynch","year":"1975","journal-title":"ACM SIGDA Newslett."},{"key":"10.1016\/0304-3975(94)00189-P_BIB15","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computation","volume":"27","author":"Ladner","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)00189-P_BIB16","unstructured":"B. Mishra, Graph theoretic issues in VLSI design, Ph.D. Thesis Carnegie-Mellon University."},{"key":"10.1016\/0304-3975(94)00189-P_BIB17","first-page":"207","article-title":"Two disjoint path problem and wire routing design","volume":"Vol. 108","author":"Ohtsuki","year":"1980"},{"key":"10.1016\/0304-3975(94)00189-P_BIB18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/322047.322048","article-title":"Finding two disjoint paths between two pairs of vertices in a graph","volume":"25","author":"Perl","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)00189-P_BIB19","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01190896","article-title":"A linear algorithm for all-bidirectional-edges problem on planar graphs","volume":"9","author":"Ramprasad","year":"1993","journal-title":"Algorithmica"},{"key":"10.1016\/0304-3975(94)00189-P_BIB20","series-title":"Proc. 30th FOCS","first-page":"282","article-title":"Optimal parallel algorithm for graph planarity","author":"Ramachandran","year":"1989"},{"key":"10.1016\/0304-3975(94)00189-P_BIB21","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0012-365X(80)90158-2","article-title":"Disjoint paths in graphs","volume":"29","author":"Seymour","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(94)00189-P_BIB22","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1145\/322203.322207","article-title":"A polynomial solution to the undirected two path problem","volume":"27","author":"Shiloach","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)00189-P_BIB23","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","article-title":"An efficient biconnectivity algorithm","volume":"14","author":"Tarjan","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)00189-P_BIB24","series-title":"Graph Theory","author":"Tutte","year":"1984"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400189P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400189P?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T16:18:39Z","timestamp":1578673119000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759400189P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["030439759400189P"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00189-p","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}