{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T09:46:09Z","timestamp":1648892769444},"reference-count":19,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1993,8,1]],"date-time":"1993-08-01T00:00:00Z","timestamp":744163200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1993,8]]},"DOI":"10.1016\/0167-8191(93)90071-r","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"873-886","source":"Crossref","is-referenced-by-count":1,"title":["Efficient parallel graph algorithms based on open ear decomposition"],"prefix":"10.1016","volume":"19","author":[{"given":"Louis","family":"Ibarra","sequence":"first","affiliation":[]},{"given":"Dana","family":"Richards","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(93)90071-R_BIB1","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF02579320","article-title":"A parallel algorithm for the maximal path problem","volume":"7","author":"Anderson","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/0167-8191(93)90071-R_BIB2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(87)90105-0","article-title":"Parallelism and the maximal path problem","volume":"24","author":"Anderson","year":"1987","journal-title":"Inform. Processing Letters"},{"key":"10.1016\/0167-8191(93)90071-R_BIB3","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0167-8191(93)90071-R_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(91)90019-X","article-title":"Approximate parallel scheduling II: Applications to logarithmic-time optimal parallel graph algorithms","volume":"92","author":"Cole","year":"1991","journal-title":"Information and Computation"},{"key":"10.1016\/0167-8191(93)90071-R_BIB5","series-title":"Introduction to Algorithms","author":"Corman","year":"1990"},{"key":"10.1016\/0167-8191(93)90071-R_BIB6","first-page":"379","article-title":"Finding triconnected components by local replacements","volume":"372","author":"Fussell","year":"1989"},{"issue":"3","key":"10.1016\/0167-8191(93)90071-R_BIB7","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1137\/0217028","article-title":"A nearly optimal parallel algorithm for constructing depth first search trees in planar graphs","volume":"17","author":"He","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-8191(93)90071-R_BIB8","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/0022-0000(91)90004-O","article-title":"Improved algorithms for four-connectivity","volume":"42","author":"Kanevsky","year":"1991","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"10.1016\/0167-8191(93)90071-R_BIB9","first-page":"128","article-title":"Ear decomposition","volume":"20","author":"Khuller","year":"1989","journal-title":"SigAct News"},{"key":"10.1016\/0167-8191(93)90071-R_BIB10","series-title":"Proc. 30th Annual IEEE Symp. on Foundations of Computer Science","first-page":"288","article-title":"Efficient parallel algorithms for testing connectivity and finding disjoint s-t paths in graphs","author":"Khuller","year":"1989"},{"key":"10.1016\/0167-8191(93)90071-R_BIB11","series-title":"Proc. 26th Annual IEEE Symp. on Foundations of Computer Science","first-page":"464","article-title":"Computing ears and branching in parallel","author":"Lov\u00e1sz","year":"1985"},{"key":"10.1016\/0167-8191(93)90071-R_BIB12","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0304-3975(86)90153-2","article-title":"Parallel ear decomposition search (eds) and st-numbering in graphs","volume":"47","author":"Maon","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0167-8191(93)90071-R_BIB13","series-title":"Proc. 19th Annual ACM Symp. on Theory of Computing","first-page":"335","article-title":"A new graph triconnectivity algorithm and its parallelization","author":"Miller","year":"1987"},{"key":"10.1016\/0167-8191(93)90071-R_BIB14","series-title":"Proc. 30th Annual IEEE Symp. on Foundations of Computer Science","first-page":"282","article-title":"An optimal parallel algorithm for graph planarity","author":"Ramachandran","year":"1989"},{"key":"10.1016\/0167-8191(93)90071-R_BIB15","first-page":"33","article-title":"Efficient parallel triconnectivity in logarithmic time","volume":"319","author":"Ramachandran","year":"1988"},{"key":"10.1016\/0167-8191(93)90071-R_BIB16","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(88)90048-8","article-title":"A linear-processor algorithm for depth-first search in planar graphs","volume":"29","author":"Shannon","year":"1988","journal-title":"Inform. Processing Letters"},{"issue":"4","key":"10.1016\/0167-8191(93)90071-R_BIB17","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","article-title":"An efficient parallel biconnectivity algorithm","volume":"14","author":"Tarjan","year":"1985","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/0167-8191(93)90071-R_BIB18","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0196-6774(83)90033-0","article-title":"Implementation of simultaneous memory address access in models that forbid it","volume":"4","author":"Vishkin","year":"1983","journal-title":"J. Algorithms"},{"key":"10.1016\/0167-8191(93)90071-R_BIB19","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1090\/S0002-9947-1932-1501641-2","article-title":"Non-separable and planar graphs","volume":"34","author":"Whitney","year":"1932","journal-title":"Trans. Amer. Math. Soc."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919390071R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919390071R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T09:28:01Z","timestamp":1551086881000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919390071R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,8]]},"references-count":19,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1993,8]]}},"alternative-id":["016781919390071R"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(93)90071-r","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1993,8]]}}}