{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T04:02:11Z","timestamp":1768881731405,"version":"3.49.0"},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":10059,"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":[[1986]]},"DOI":"10.1016\/0304-3975(86)90153-2","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"277-298","source":"Crossref","is-referenced-by-count":78,"special_numbering":"C","title":["Parallel ear decomposition search (EDS) and st-numbering in graphs"],"prefix":"10.1016","volume":"47","author":[{"given":"Yael","family":"Maon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uzi","family":"Vishkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(86)90153-2_BIB1","series-title":"Proc. 17th ACM Symp. on Theory of Computing","first-page":"33","article-title":"A parallel algorithm for the maximal path problem","author":"Anderson","year":"1985"},{"key":"10.1016\/0304-3975(86)90153-2_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579338","article-title":"An O(n log n) sorting network","volume":"3","author":"Ajtai","year":"1983","journal-title":"Combinatorica"},{"key":"10.1016\/0304-3975(86)90153-2_BIB3","series-title":"Proc. 27th Symp. on Foundations of Computer Science","first-page":"478","article-title":"Approximate and exact parallel scheduling with applications to list, tree and graph problems","author":"Cole","year":"1986"},{"key":"10.1016\/0304-3975(86)90153-2_BIB4","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"key":"10.1016\/0304-3975(86)90153-2_BIB5","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","article-title":"Computing an st-numbering","volume":"2","author":"Even","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(86)90153-2_BIB6","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computation","volume":"27","author":"Fisher","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(86)90153-2_BIB7","series-title":"Proc. 25th Symp. on Foundations of Computer Science","first-page":"137","article-title":"The multi-tree approach to reliability in distributed networks","author":"Itai","year":"1984"},{"key":"10.1016\/0304-3975(86)90153-2_BIB8","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1137\/0211024","article-title":"Parallel algorithms in graph theory: Planarity testing","volume":"11","author":"Ja'Ja'","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(86)90153-2_BIB9","series-title":"Proc. 27th Symp. on Foundations of Computer Science","first-page":"465","article-title":"An efficient parallel algorithm for planarity","author":"Klein","year":"1986"},{"key":"10.1016\/0304-3975(86)90153-2_BIB10","series-title":"Proc. 26th Symp. on Foundations of Computer Science","first-page":"464","article-title":"Computing ears and branchings in parallel","author":"Lovasz","year":"1985"},{"key":"10.1016\/0304-3975(86)90153-2_BIB11","series-title":"Proc. Internat. Symp. on Theory of Graphs","first-page":"215","article-title":"an algorithm for planarity testing of graphs","author":"Lempel","year":"1967"},{"key":"10.1016\/0304-3975(86)90153-2_BIB12","series-title":"Proc. 26th Symp. on Foundations of Computer Science","first-page":"496","article-title":"An optimal parallel algorithm for integer sorting","author":"Reif","year":"1985"},{"key":"10.1016\/0304-3975(86)90153-2_BIB13","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","article-title":"An O(log n) parallel connectivity algorithm","volume":"3","author":"Shiloach","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(86)90153-2_BIB14","unstructured":"B. Schieber and U. Vishkin, Parallel computation of lowest common ancestors in trees, in preparation."},{"key":"10.1016\/0304-3975(86)90153-2_BIB15","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1109\/TC.1983.1676178","article-title":"The VLSI complexity of sorting","volume":"32","author":"Thompson","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(86)90153-2_BIB16","first-page":"85","article-title":"Two streamlined depth-first search algorithms","volume":"9","author":"Tarjan","year":"1986","journal-title":"Fund. Inform."},{"key":"10.1016\/0304-3975(86)90153-2_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."},{"key":"10.1016\/0304-3975(86)90153-2_BIB18","series-title":"TR #71","article-title":"Synchronous parallel computation\u2014a survey","author":"Vishkin","year":"1983"},{"key":"10.1016\/0304-3975(86)90153-2_BIB19","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0020-0190(85)90025-0","article-title":"On efficient parallel strong orientation","volume":"20","author":"Vishkin","year":"1985","journal-title":"Inform. Process Lett."},{"key":"10.1016\/0304-3975(86)90153-2_BIB20","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":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586901532?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586901532?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T08:53:16Z","timestamp":1553158396000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397586901532"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":20,"alternative-id":["0304397586901532"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(86)90153-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1986]]}}}