{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T11:47:22Z","timestamp":1763466442675},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"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":5464,"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":[[1998,8]]},"DOI":"10.1016\/s0304-3975(98)00021-8","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"205-223","source":"Crossref","is-referenced-by-count":17,"title":["Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms"],"prefix":"10.1016","volume":"203","author":[{"given":"Shiva","family":"Chaudhuri","sequence":"first","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(98)00021-8_BIB1","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/BF01459088","article-title":"Zum Hilbertschen Aufbau der reellen Zahlen","volume":"99","author":"Ackermann","year":"1928","journal-title":"Math. Ann."},{"key":"10.1016\/S0304-3975(98)00021-8_BIB2","series-title":"Network Flows","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0304-3975(98)00021-8_BIB3","article-title":"Optimal preprocessing for answering on-line product queries","author":"Alon","year":"1987"},{"key":"10.1016\/S0304-3975(98)00021-8_BIB4","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01934985","article-title":"Efficient algorithms for combinatorial problems on graphs with bounded decomposabilitya survey","volume":"25","author":"Arnborg","year":"1985","journal-title":"BIT"},{"key":"10.1016\/S0304-3975(98)00021-8_BIB5","series-title":"Proc. 14th Workshop on Graph-Theoretic Concepts in Comp. Sci. (WG'88)","first-page":"1","article-title":"NC-algorithms for graphs with small treewidth","volume":"vol. 344","author":"Bodlaender","year":"1989"},{"issue":"1\u20132","key":"10.1016\/S0304-3975(98)00021-8_BIB6","first-page":"1","article-title":"A tourist guide through treewidth","volume":"11","author":"Bodlaender","year":"1993","journal-title":"Acta Cybernet."},{"key":"10.1016\/S0304-3975(98)00021-8_BIB7","series-title":"Proc. 22nd Internat. Coll. on Automata, Languages and Programming (ICALP'95)","first-page":"268","article-title":"Parallel algorithms with optimal speedup for bounded treewidth","volume":"vol. 944","author":"Bodlaender","year":"1995"},{"key":"10.1016\/S0304-3975(98)00021-8_BIB8","series-title":"Proc. 22nd Internat Coll. on Automata, Languages and Programming (ICALP'95)","first-page":"244","article-title":"Shortest path queries in digraphs of small treewidth","volume":"vol. 944","author":"Chaudhuri","year":"1995"},{"key":"10.1016\/S0304-3975(98)00021-8_BIB9","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(98)00021-8_BIB10","series-title":"Proc. 12th Symp. on Theor. Aspects of Comp. Sci. (STACS'95)","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(98)00021-8_BIB11","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"},{"key":"10.1016\/S0304-3975(98)00021-8_BIB12","series-title":"An Introduction to Parallel Algorithms","author":"J\u00e1J\u00e1","year":"1992"},{"key":"10.1016\/S0304-3975(98)00021-8_BIB13","series-title":"Proc. 5th Internat Symp. on Algorithms and Computation (ISAAC'94)","first-page":"270","article-title":"Efficient sequential and parallel algorithms for the negative cycle problem","volume":"vol. 834","author":"Kavvadias","year":"1994"},{"key":"10.1016\/S0304-3975(98)00021-8_BIB14","series-title":"Proc. 34th IEEE Symp. on Foundations of Comp. Sci.","first-page":"259","article-title":"A linear-processor polylog-time algorithm for shortest paths in planar graphs","author":"Klein","year":"1993"},{"key":"10.1016\/S0304-3975(98)00021-8_BIB15","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","article-title":"Graph minors I: excluding a forest","volume":"35","author":"Robertson","year":"1983","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0304-3975(98)00021-8_BIB16","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","article-title":"Graph minors II: algorithmic aspects of treewidth","volume":"7","author":"Robertson","year":"1986","journal-title":"J. Algorithms"},{"issue":"6","key":"10.1016\/S0304-3975(98)00021-8_BIB17","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/0217079","article-title":"On finding lowest common ancestors: simplification and parallelization","volume":"17","author":"Schieber","year":"1988","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000218?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000218?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T09:01:41Z","timestamp":1555405301000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598000218"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["S0304397598000218"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00021-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}