{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:10:16Z","timestamp":1778249416713,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540602163","type":"print"},{"value":"9783540447337","type":"electronic"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0030835","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T03:51:40Z","timestamp":1133409100000},"page":"213-222","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Shortest paths in random weighted graphs"],"prefix":"10.1007","author":[{"given":"Scott K.","family":"Walley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harry H.","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"22_CR1","unstructured":"R. K. Ahuja, K. Mehlhorn, J. B. Orlin, and R. E. Tarjan: Faster Algorithms for the Shortest Path Problem. Technical Report CS-TR-154-88, Department of Computer Science, Princeton University. (1988)"},{"key":"22_CR2","volume-title":"Technical Report 80-3","author":"P.A. Bloniarz","year":"1980","unstructured":"P.A. Bloniarz: A shortest-path algorithm with expected time O(n\n2 log n log*\nn). Technical Report 80-3, Dept. of Computer Science, State Univ. of New York at Albany. (1980)"},{"key":"22_CR3","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M. L. Fredman","year":"1987","unstructured":"M. L. Fredman and R. E. Tarjan: Fibonacci heaps and their uses in improved network optimization algorithms. J. Assoc. Comput. Mach. 34 (1987) 596\u2013615","journal-title":"J. Assoc. Comput. Mach."},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0166-218X(85)90059-9","volume":"10","author":"A. M. Frieze","year":"1985","unstructured":"A. M. Frieze and G. R. Grimmett: The shortest-path problem for graphs with random arc-lengths. Discrete Appl. Math. 10 (1985) 57\u201377","journal-title":"Discrete Appl. Math."},{"key":"22_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02288320","volume":"13","author":"G. Gallo","year":"1988","unstructured":"G. Gallo and S. Pallottino: Shortest path algorithms. Annals of Oper. Res. 13 (1988) 3\u201379","journal-title":"Annals of Oper. Res."},{"key":"22_CR6","unstructured":"A. V. Goldberg: Scaling algorithms for the shortest paths problem. Proc. 4th ACM-SIAM symposium of Discrete Algorithms. (1993) 222\u2013231"},{"key":"22_CR7","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1287\/moor.10.4.557","volume":"10","author":"R. Hassin","year":"1985","unstructured":"Refael Hassin and Eitan Zemel: On shortest paths in graphs with random weights. Math. of Oper. Res. 10 (1985) 557\u2013564","journal-title":"Math. of Oper. Res."},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1137\/0202004","volume":"2","author":"P. Spira","year":"1973","unstructured":"P. Spira: A new algorithm for finding all shortest paths in a graph of positive edges in average time O(n\n2log2\nn). SIAM J. Comput. 2 (1973) 28\u201332","journal-title":"SIAM J. Comput."},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Scott K. Walley, Harry H. Tan, and Audrey M. Viterbi. Shortest path cost distribution in random graphs with positive integer edge costs. Proc. of IEEE INFO-COM'93. (1993) 1023\u20131032","DOI":"10.1109\/INFCOM.1993.253263"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030835","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:14:13Z","timestamp":1778246053000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0030835"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602163","9783540447337"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0030835","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"20 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}