{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:55Z","timestamp":1725664255018},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540583387"},{"type":"electronic","value":"9783540486633"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58338-6_93","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:51:07Z","timestamp":1330271467000},"page":"462-472","source":"Crossref","is-referenced-by-count":3,"title":["Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems"],"prefix":"10.1007","author":[{"given":"Dimitris","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":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"issue":"3","key":"39_CR1","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01762120","volume":"3","author":"A. Aggarwal","year":"1988","unstructured":"A. Aggarwal, B. Chazelle, L. Guibas, C. \u00d3'D\u00fanlaing, and C. Yap, \u201cParallel Computational Geometry\u201d, Algorithmica, 3(3), 1988, 293\u2013328.","journal-title":"Algorithmica"},{"key":"39_CR2","unstructured":"K.W. Chong and T.W. Lam, \u201cFinding Connected Components in O(log n log log n) time on an EREW PRAM\u201d, Proc. 4th AGM-SIAM SODA, 1993, pp.11\u201320."},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"E. Cohen, \u201cEfficient Parallel Shortest-paths in Digraphs with a Separator Decomposition\u201d, Proc. 5th ACM SPAA, 1993, pp.57\u201367.","DOI":"10.1145\/165231.165240"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"R. Cole, \u201cParallel Merge Sort\u201d, Proc. 27th IEEE FOCS, 1986, pp.511\u2013516.","DOI":"10.1109\/SFCS.1986.41"},{"issue":"3","key":"39_CR5","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"D. Coppersmith and S. Winograd, \u201cMatrix multiplication via arithmetic progressions\u201d, J. of Symbolic Computations, 9(3), 1990, pp. 251\u2013280.","journal-title":"J. of Symbolic Computations"},{"key":"39_CR6","first-page":"327","volume":"510","author":"H. Djidjev","year":"1991","unstructured":"H. Djidjev, G. Pantziou and C. Zaroliagis, \u201cComputing Shortest Paths and Distances in Planar Graphs\u201d, in Proc. 18th ICALP, 1991, LNCS, Vol. 510, pp. 327\u2013339.","journal-title":"LNCS"},{"issue":"No.1","key":"39_CR7","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1145\/102782.102788","volume":"38","author":"G.N. Frederickson","year":"1991","unstructured":"G.N. Frederickson, \u201cPlanar Graph Decomposition and All Pairs Shortest Paths\u201d, J. ACM, Vol. 38, No.1, January 1991, pp. 162\u2013204.","journal-title":"J. ACM"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"G.N. Frederickson, \u201cUsing Cellular Graph Embeddings in Solving All Pairs Shortest Path Problems\u201d, Proc. 30th Annual IEEE FOCS, 1989, pp.448\u2013453.","DOI":"10.1109\/SFCS.1989.63517"},{"key":"39_CR9","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF01762113","volume":"3","author":"G.N. Frederickson","year":"1988","unstructured":"G.N. Frederickson and R. Janardan, \u201cDesigning Networks with Compact Routing Tables\u201d, Algorithmica, 3(1988), pp. 171\u2013190.","journal-title":"Algorithmica"},{"key":"39_CR10","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M. Fredman","year":"1987","unstructured":"M. Fredman and R. Tarjan, \u201cFibonacci heaps and their uses in improved network optimization algorithms\u201d, JACM, 34(1987), pp. 596\u2013615.","journal-title":"JACM"},{"key":"39_CR11","unstructured":"H. Gazit and G. Miller, \u201cA deterministic parallel algorithm for finding a separator in planar graphs\u201d, Report CMU-CS-91-103, Carnegie-Mellon University, 1991."},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"M. Goodrich, \u201cIntersecting Line Segments in Parallel with an Output-Sensitive Number of Processors\u201d, Proc. 1st ACM SPAA, June 1989, pp.127\u2013136.","DOI":"10.1145\/72935.72950"},{"key":"39_CR13","unstructured":"J.L. Gross and T.W. Tucker, \u201cTopological Graph Theory\u201d, John Wiley, 1987."},{"key":"39_CR14","doi-asserted-by":"crossref","unstructured":"Y. Han, V. Pan and J. Reif, \u201cEfficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs\u201d, Proc. 4th ACM SPAA, 1992, pp.353\u2013362.","DOI":"10.1145\/140901.141913"},{"key":"39_CR15","unstructured":"J. J\u00e1J\u00e1, \u201cAn Introduction to Parallel Algorithms\u201d, Addison-Wesley, 1992."},{"key":"39_CR16","doi-asserted-by":"crossref","unstructured":"R. Karp and V. Ramachandran, \u201cParallel Algorithms for Shared-Memory Machines\u201d, Handbook of Theoretical Computer Science, Ed. J. van Leeuwen, pp.869\u2013941, 1990, Elsevier Science Publishers.","DOI":"10.1016\/B978-0-444-88071-0.50022-9"},{"key":"39_CR17","volume-title":"CTI Technical Report, TR-93.05.22","author":"D. Kavvadias","year":"1993","unstructured":"D. Kavvadias, G. Pantziou, P. Spirakis and C. Zaroliagis, \u201cHammock-on-Ears Decomposition: A Technique for Parallel and On-line Path Problems\u201d, CTI Technical Report, TR-93.05.22, Computer Technology Institute, Patras, 1993."},{"key":"39_CR18","doi-asserted-by":"crossref","unstructured":"D. Kavvadias, G. Pantziou, P. Spirakis and C. Zaroliagis, \u201cEfficient Sequential and Parallel Algorithms for the Negative Cycle Problem\u201d, Proc. 5th ISAAC'94, LNCS, to appear.","DOI":"10.1007\/3-540-58325-4_190"},{"key":"39_CR19","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0304-3975(86)90153-2","volume":"47","author":"Y. Maon","year":"1986","unstructured":"Y. Maon, B. Schieber and U. Vishkin, \u201cParallel ear decomposition search (EDS) and st-numbering in graphs\u201d, Theoretical Computer Science, 47(1986), pp. 277\u2013298.","journal-title":"Theoretical Computer Science"},{"key":"39_CR20","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1137\/0214021","volume":"No.14","author":"E.M. McCreight","year":"1985","unstructured":"E.M. McCreight, \u201cPriority Search Trees\u201d, SIAM Journal on Computing, No.14, 1985, 257\u2013276.","journal-title":"SIAM Journal on Computing"},{"key":"39_CR21","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01994878","volume":"32","author":"G. Pantziou","year":"1992","unstructured":"G. Pantziou, P. Spirakis and C. Zaroliagis, \u201cEfficient Parallel Algorithms for Shortest Paths in Planar Digraphs\u201d, BIT 32 (1992), pp. 215\u2013236.","journal-title":"BIT"},{"key":"39_CR22","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","volume":"3","author":"Y. Shiloach","year":"1982","unstructured":"Y. Shiloach and U. Vishkin, \u201cAn O(log n) parallel connectivity algorithm\u201d, J. of Algorithms, Vol. 3, 1982, pp. 57\u201367.","journal-title":"J. of Algorithms"},{"key":"39_CR23","doi-asserted-by":"crossref","unstructured":"R.E. Tarjan, \u201cData Structures and Network Algorithms\u201d, SIAM, 1983.","DOI":"10.1137\/1.9781611970265"},{"key":"39_CR24","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1016\/0196-6774(89)90006-0","volume":"10","author":"C. Thomassen","year":"1989","unstructured":"C. Thomassen, \u201cThe graph genus problem is NP-complete\u201d, J. of Algorithms, 10(1989), pp. 568\u2013576.","journal-title":"J. of Algorithms"},{"key":"39_CR25","doi-asserted-by":"crossref","unstructured":"J. van Leeuwen and R. Tan, \u201cComputer Networks with compact routing tables\u201d, The Book of L, G. Rozenberg and A. Salomaa (eds.), Springer, 1986, pp.259\u2013273.","DOI":"10.1007\/978-3-642-95486-3_22"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1994"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58338-6_93.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:19:53Z","timestamp":1605647993000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58338-6_93"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540583387","9783540486633"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-58338-6_93","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}