{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:28:20Z","timestamp":1757629700988,"version":"3.44.0"},"reference-count":35,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T00:00:00Z","timestamp":1164758400000},"content-version":"vor","delay-in-days":5691,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1991,5]]},"DOI":"10.1016\/0890-5401(91)90019-x","type":"journal-article","created":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T19:24:20Z","timestamp":1101929060000},"page":"1-47","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":59,"title":["Approximate parallel scheduling. II. Applications to logarithmic-time optimal parallel graph algorithms"],"prefix":"10.1016","volume":"92","author":[{"given":"Richard","family":"Cole","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uzi","family":"Vishkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1974","author":"Aho","key":"10.1016\/0890-5401(91)90019-X_BIB1"},{"key":"10.1016\/0890-5401(91)90019-X_BIB2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0020-0190(84)90072-3","article-title":"Parallel strong orientation of an undirected graph","volume":"18","author":"Atallah","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(91)90019-X_BIB3","series-title":"Proc. Sixteenth Annual ACM Symp. on Theory of Computing","first-page":"249","article-title":"Finding Euler circuits in logarithmic parallel time","author":"Awerbuch","year":"1984"},{"key":"10.1016\/0890-5401(91)90019-X_BIB4","series-title":"Proc. Int. Conf. on Parallel Processing","first-page":"175","article-title":"New connectivity and MSF algorithms for ultracomputer and PRAM","author":"Awerbuch","year":"1983"},{"key":"10.1016\/0890-5401(91)90019-X_BIB5","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/0022-0000(84)90003-5","article-title":"Finding Euler tours in parallel","volume":"29","author":"Atallah","year":"1984","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"10.1016\/0890-5401(91)90019-X_BIB6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321812.321815","article-title":"The parallel evaluation of general arithmetic expressions","volume":"21","author":"Brent","year":"1974","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(91)90019-X_BIB7","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0020-0190(88)90186-X","article-title":"An optimally efficient selection algorithm","volume":"26","author":"Cole","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(91)90019-X_BIB8","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1145\/358628.358650","article-title":"Efficient parallel algorithms for some graph problems","volume":"25","author":"Chin","year":"1982","journal-title":"Comm. ACM"},{"key":"10.1016\/0890-5401(91)90019-X_BIB9","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/S0019-9958(86)80023-7","article-title":"Deterministic coin tossing with applications to optimal parallel list ranking","volume":"70","author":"Cole","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0890-5401(91)90019-X_BIB10","series-title":"Proc. Eighteenth Annual ACM Symp. on Theory of Computing","first-page":"206","article-title":"Deterministic coin tossing and accelerating cascades: Micro and macro techniques for designing parallel algorithms","author":"Cole","year":"1986"},{"key":"10.1016\/0890-5401(91)90019-X_BIB11","series-title":"Proc. Twenty Seventh Annual 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\/0890-5401(91)90019-X_BIB12","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/0890-5401(89)90036-9","article-title":"Faster optimal parallel prefix sums and list ranking","volume":"81","author":"Cole","year":"1989","journal-title":"Inform. and Comput."},{"year":"1987","author":"Cole","key":"10.1016\/0890-5401(91)90019-X_BIB13"},{"key":"10.1016\/0890-5401(91)90019-X_BIB14","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF01762121","article-title":"The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time","volume":"3","author":"Cole","year":"1988","journal-title":"Algorithmica"},{"issue":"1","key":"10.1016\/0890-5401(91)90019-X_BIB15","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1137\/0217009","article-title":"Approximate parallel scheduling. I. The basic technique with applications to optimal parallel list ranking in logarithmic time","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(91)90019-X_BIB16","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/0743-7315(90)90103-V","article-title":"An optimal parallel algorithm for building a data structure for planar point location","volume":"8","author":"Cole","year":"1990","journal-title":"J. Parallel Distrib. Comput."},{"year":"1979","author":"Even","key":"10.1016\/0890-5401(91)90019-X_BIB17"},{"key":"10.1016\/0890-5401(91)90019-X_BIB18","series-title":"Proc. Twenty Seventh Annual Symp. on Foundations of Computer Science","first-page":"492","article-title":"An optimal randomized parallel algorithm for finding connected components in a graph","author":"Gazit","year":"1986"},{"key":"10.1016\/0890-5401(91)90019-X_BIB19","series-title":"Proc. 3rd AWOC","first-page":"24","article-title":"Optimal parallel algorithms on planar graphs","author":"Hagerup","year":"1988"},{"key":"10.1016\/0890-5401(91)90019-X_BIB20_1","series-title":"Proc. 14th ICALP","first-page":"304","article-title":"Optimal parallel 5-coloring of planar graphs","author":"Hagerup","year":"1989"},{"key":"10.1016\/0890-5401(91)90019-X_BIB20_2","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1137\/0218020","volume":"18","author":"Hagerup","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(91)90019-X_BIB21","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/359138.359141","article-title":"Computing connected components on parallel computers","volume":"22","author":"Hirschberg","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1016\/0890-5401(91)90019-X_BIB22_1","series-title":"Fifth International Conference on Fundamentals of Computer Science","first-page":"208","article-title":"Parallel algorithms for connected components in a graph","author":"Koubek","year":"1987"},{"key":"10.1016\/0890-5401(91)90019-X_BIB22_2","doi-asserted-by":"crossref","unstructured":"Kruskal, C. P., Rudolph, L., and Snir, M. Efficient parallel algorithms for graph problems, Algorithmica5, 43\u201364.","DOI":"10.1007\/BF01840376"},{"key":"10.1016\/0890-5401(91)90019-X_BIB23","series-title":"Proc. Twenty Sixth Annual Symp. on Foundations of Computer Science","first-page":"464","article-title":"Computing ears and branchings in parallel","author":"Lovasz","year":"1985"},{"key":"10.1016\/0890-5401(91)90019-X_BIB24","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\/0890-5401(91)90019-X_BIB25","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1137\/0210051","article-title":"Fast, efficient parallel algorithms for some graph problems","volume":"10","author":"Savage","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(91)90019-X_BIB26","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\/0890-5401(91)90019-X_BIB27","first-page":"1253","article-title":"On finding lowest common ancestors: Simplification and parallelization","volume":"17","author":"Schieber","year":"1987"},{"key":"10.1016\/0890-5401(91)90019-X_BIB28","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1137\/0213036","article-title":"Efficient parallel algorithms for a class of graph theoretic problems","volume":"13","author":"Tsin","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(91)90019-X_BIB29","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."},{"year":"1983","series-title":"Synchronous parallel computation\u2014A survey","author":"Vishkin","key":"10.1016\/0890-5401(91)90019-X_BIB30"},{"key":"10.1016\/0890-5401(91)90019-X_BIB31","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0166-218X(84)90019-2","article-title":"An optimal parallel connectivity algorithm","volume":"9","author":"Vishkin","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0890-5401(91)90019-X_BIB32","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."},{"year":"1979","series-title":"The complexity of parallel computation","author":"Wyllie","key":"10.1016\/0890-5401(91)90019-X_BIB33"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190019X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190019X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T15:10:07Z","timestamp":1757517007000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019190019X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["089054019190019X"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(91)90019-x","relation":{},"ISSN":["0890-5401"],"issn-type":[{"type":"print","value":"0890-5401"}],"subject":[],"published":{"date-parts":[[1991,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Approximate parallel scheduling. II. Applications to logarithmic-time optimal parallel graph algorithms","name":"articletitle","label":"Article Title"},{"value":"Information and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0890-5401(91)90019-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1991 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}