{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:35:18Z","timestamp":1699835718886},"reference-count":8,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":10359,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1978,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A mean\u2010time comparison of the algorithms of Floyd, Dantzig, Tabourier, and of repeated application of several single\u2010source algorithms, for the all\u2010pairs shortest\u2010path problem with arbitrary arc lengths clearly demonstrates the superiority of the Tabourier procedure for networks in which an average of at least 25% of the potential direct arcs are present. For very sparse networks, repeated application of a single\u2010source label\u2010correcting algorithm is found to be preferable.<\/jats:p>","DOI":"10.1002\/net.3230080203","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T08:18:52Z","timestamp":1178871532000},"page":"97-106","source":"Crossref","is-referenced-by-count":9,"title":["A mean\u2010time comparison of algorithms for the all\u2010pairs shortest\u2010path problem with arbitrary arc lengths"],"prefix":"10.1002","volume":"8","author":[{"given":"W. D.","family":"Kelton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. M.","family":"Law","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","unstructured":"Dantzig G. B. \u201cAll Shortest Routes in a Graph \u201dTechnical Report 66\u20103 Operations Research House Stanford University 1966.","DOI":"10.21236\/AD0646551"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.17.3.395"},{"key":"e_1_2_1_4_2","volume-title":"The Art and Theory of Dynamic Programming","author":"Dreyfus S. E.","year":"1977"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"e_1_2_1_6_2","doi-asserted-by":"crossref","unstructured":"Gilsinn J.andC.Witzgall \u201cA Performance Comparison of Labeling Algorithms for Calculating Shortest Path Trees \u201dNBS Technical Note 772 National Bureau of Standards 1973.","DOI":"10.6028\/NBS.TN.772"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.24.6.1164"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585517"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(73)90118-0"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230080203","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230080203","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T08:35:34Z","timestamp":1699778134000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230080203"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,6]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1978,6]]}},"alternative-id":["10.1002\/net.3230080203"],"URL":"https:\/\/doi.org\/10.1002\/net.3230080203","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978,6]]}}}