{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T01:10:28Z","timestamp":1759626628800,"version":"build-2065373602"},"reference-count":42,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6102,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,11]]},"DOI":"10.1016\/s0304-3975(96)00065-5","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"121-154","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"title":["Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems"],"prefix":"10.1016","volume":"168","author":[{"given":"Dimitris J.","family":"Kavvadias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grammati E.","family":"Pantziou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos D.","family":"Zaroliagis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00065-5_BIB1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0196-6774(89)90017-5","article-title":"A simple parallel tree contraction algorithm","volume":"10","author":"Abrahamson","year":"1989","journal-title":"J. Algorithms"},{"issue":"3","key":"10.1016\/S0304-3975(96)00065-5_BIB2","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01762120","article-title":"Parallel computational geometry","volume":"3","author":"Aggarwal","year":"1988","journal-title":"Algorithmica"},{"year":"1993","series-title":"Network Flows","author":"Ahuja","key":"10.1016\/S0304-3975(96)00065-5_BIB3"},{"key":"10.1016\/S0304-3975(96)00065-5_BIB4","series-title":"Proc. 3rd European Symp. on Algorithms","first-page":"31","article-title":"Optimal parallel shortest paths in small treewidth digraphs","volume":"Vol. 979","author":"Chaudhuri","year":"1995"},{"key":"10.1016\/S0304-3975(96)00065-5_BIB5","series-title":"Proc. 4th ACM-SIAM Symp. on Discrete Algorithms","first-page":"11","article-title":"Finding connected components in O(log n log log n) time on an EREW PRAM","author":"Chong","year":"1993"},{"key":"10.1016\/S0304-3975(96)00065-5_BIB6","series-title":"Proc. 5th ACM Symp. on Parallel Algorithms and Architectures","first-page":"57","article-title":"Efficient parallel shortest-paths in digraphs with a separator decomposition","author":"Cohen","year":"1993"},{"key":"10.1016\/S0304-3975(96)00065-5_BIB7","series-title":"Proc. 27th IEEE Symp. on Foundations of Computer Science","first-page":"511","article-title":"Parallel merge sort","author":"Cole","year":"1986"},{"key":"10.1016\/S0304-3975(96)00065-5_BIB8","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"},{"issue":"1","key":"10.1016\/S0304-3975(96)00065-5_BIB9","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1137\/0217009","article-title":"Approximate parallel scheduling. Part I: the basic technique with applications to optimal parallel list ranking in logarithmic time","volume":"17","author":"Cole","year":"1989","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/S0304-3975(96)00065-5_BIB10","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","article-title":"Matrix multiplication via arithmetic progressions","volume":"9","author":"Coppersmith","year":"1990","journal-title":"J. Symbol. Comput."},{"year":"1990","series-title":"Introduction to Algorithms","author":"Cormen","key":"10.1016\/S0304-3975(96)00065-5_BIB11"},{"key":"10.1016\/S0304-3975(96)00065-5_BIB12","series-title":"Proc. 15th Symp. on Mathematical Foundations of Computer Science","first-page":"207","article-title":"Optimal parallel algorithms for the recognition and colouring of outerplanar graphs","volume":"Vol. 379","author":"Diks","year":"1989"},{"key":"10.1016\/S0304-3975(96)00065-5_BIB13","first-page":"369","article-title":"A linear algorithm for partitioning graphs of fixed genus","volume":"11","author":"Djidjev","year":"1985","journal-title":"SERDICA"},{"key":"10.1016\/S0304-3975(96)00065-5_BIB14","series-title":"Proc. 18th Internat. Coll. on Automata, Languages and Programming","first-page":"327","article-title":"Computing shortest paths and distances in planar graphs","volume":"Vol. 510","author":"Djidjev","year":"1991"},{"key":"10.1016\/S0304-3975(96)00065-5_BIB15","series-title":"Proc. 12th Symp. on Theoretical Aspects of Computer Science","first-page":"193","article-title":"On-line and dynamic algorithms for shortest path problems","volume":"Vol. 900","author":"Djidjev","year":"1995"},{"key":"10.1016\/S0304-3975(96)00065-5_BIB16","series-title":"Proc. 30th IEEE Symp. on Foundations of Computer Science","first-page":"448","article-title":"Using cellular graph embeddings in solving all pairs shortest path problems","author":"Frederickson","year":"1989"},{"issue":"1","key":"10.1016\/S0304-3975(96)00065-5_BIB17","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1145\/102782.102788","article-title":"Planar graph decomposition and all pairs shortest paths","volume":"38","author":"Frederickson","year":"1991","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(96)00065-5_BIB18","series-title":"Proc. 20th Internat. Coll. on Automata, Languages and Programming","first-page":"28","article-title":"Searching among intervals and compact routing tables","volume":"Vol. 700","author":"Frederickson","year":"1993"},{"key":"10.1016\/S0304-3975(96)00065-5_BIB19","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF01762113","article-title":"Designing networks with compact routing tables","volume":"3","author":"Frederickson","year":"1988","journal-title":"Algorithmica"},{"article-title":"A deterministic parallel algorithm for finding a separator in planar graphs","year":"1991","author":"Gazit","key":"10.1016\/S0304-3975(96)00065-5_BIB20"},{"key":"10.1016\/S0304-3975(96)00065-5_BIB21","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0196-6774(84)90019-1","article-title":"A separator theorem for graphs of bounded genus","volume":"5","author":"Gilbert","year":"1984","journal-title":"J. Algorithms"},{"issue":"4","key":"10.1016\/S0304-3975(96)00065-5_BIB22","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1137\/0401044","article-title":"Parallel symmetry-breaking in sparse graphs","volume":"1","author":"Goldberg","year":"1988","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(96)00065-5_BIB23","series-title":"Proc. 1st ACM Symp. on Parallel Algorithms and Architectures","first-page":"127","article-title":"Intersecting line segments in parallel with an output-sensitive number of processors","author":"Goodrich","year":"1989"},{"year":"1987","series-title":"Topological Graph Theory","author":"Gross","key":"10.1016\/S0304-3975(96)00065-5_BIB24"},{"key":"10.1016\/S0304-3975(96)00065-5_BIB25","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0890-5401(90)90034-F","article-title":"Optimal parallel algorithms for planar graphs","volume":"84","author":"Hagerup","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(96)00065-5_BIB26","series-title":"Proc. 4th ACM Symp. on Parallel Algorithms and Architectures","first-page":"353","article-title":"Efficient parallel algorithms for computing all pair shortest paths in directed graphs","author":"Han","year":"1992"},{"year":"1969","series-title":"Graph Theory","author":"Harary","key":"10.1016\/S0304-3975(96)00065-5_BIB27"},{"year":"1992","series-title":"An Introduction to Parallel Algorithms","author":"J\u00e1J\u00e1","key":"10.1016\/S0304-3975(96)00065-5_BIB28"},{"key":"10.1016\/S0304-3975(96)00065-5_BIB29","first-page":"869","article-title":"Parallel algorithms for shared-memory machines","volume":"Vol. A","author":"Karp","year":"1990"},{"year":"1976","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","key":"10.1016\/S0304-3975(96)00065-5_BIB30"},{"key":"10.1016\/S0304-3975(96)00065-5_BIB31","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\/S0304-3975(96)00065-5_BIB32","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1137\/0214021","article-title":"Priority search trees","volume":"14","author":"McCreight","year":"1985","journal-title":"SIAM J. Comput."},{"year":"1984","series-title":"Data Structures and Algorithms 3: Multidimensional Searching and Computational Geometry","author":"Mehlhorn","key":"10.1016\/S0304-3975(96)00065-5_BIB33"},{"key":"10.1016\/S0304-3975(96)00065-5_BIB34","series-title":"Proc. Conf. on Fundamentals of Computation Theory","first-page":"302","article-title":"A single source shortest path algorithm for graphs with separators","volume":"Vol. 158","author":"Mehlhorn","year":"1983"},{"key":"10.1016\/S0304-3975(96)00065-5_BIB35","series-title":"Proc. 32nd IEEE Symp. on Foundations of Computer Science","first-page":"538","article-title":"A unified geometric approach to graph separators","author":"Miller","year":"1991"},{"key":"10.1016\/S0304-3975(96)00065-5_BIB36","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01994878","article-title":"Efficient parallel algorithms for shortest paths in planar digraphs","volume":"32","author":"Pantziou","year":"1992","journal-title":"BIT"},{"article-title":"Interprocedural dataflow analysis via graph reachability","year":"1994","author":"Reps","key":"10.1016\/S0304-3975(96)00065-5_BIB37"},{"key":"10.1016\/S0304-3975(96)00065-5_BIB38","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\/S0304-3975(96)00065-5_BIB39","series-title":"Proc. 13th Internat. Coll. on Automata, Languages and Programming","first-page":"397","article-title":"A very fast, practical algorithm for finding a negative cycle in a digraph","volume":"Vol. 226","author":"Spirakis","year":"1986"},{"key":"10.1016\/S0304-3975(96)00065-5_BIB40","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1016\/0196-6774(89)90006-0","article-title":"The graph genus problem is NP-complete","volume":"10","author":"Thomassen","year":"1989","journal-title":"J. Algorithms"},{"issue":"2","key":"10.1016\/S0304-3975(96)00065-5_BIB41","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1145\/103135.103137","article-title":"INC: a language for incremental computations","volume":"13","author":"Yellin","year":"1991","journal-title":"ACM Trans. Prog. Lang. Systems"},{"key":"10.1016\/S0304-3975(96)00065-5_BIB42","first-page":"259","article-title":"Computer networks with compact routing tables","author":"van Leeuwen","year":"1986"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596000655?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596000655?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:51:12Z","timestamp":1759625472000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596000655"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["S0304397596000655"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00065-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1996,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(96)00065-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}