{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T08:50:15Z","timestamp":1699779015315},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1973,1,1]],"date-time":"1973-01-01T00:00:00Z","timestamp":94694400000},"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":14807,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1973]]},"DOI":"10.1016\/0012-365x(73)90118-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:45:00Z","timestamp":1027640700000},"page":"83-87","source":"Crossref","is-referenced-by-count":20,"title":["All shortest distances in a graph. An improvement to Dantzig's inductive algorithm"],"prefix":"10.1016","volume":"4","author":[{"given":"Yves","family":"Tabourier","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(73)90118-0_BIB1","series-title":"Theory of graphs","first-page":"91","article-title":"All shortest routes in a graph","author":"Dantzig","year":"1967"},{"key":"10.1016\/0012-365X(73)90118-0_BIB2","series-title":"Theory of graphs","first-page":"85","article-title":"All shortest routes from a fixed origin in a graph","author":"Dantzig","year":"1967"},{"key":"10.1016\/0012-365X(73)90118-0_BIB3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numerische Math."},{"issue":"3","key":"10.1016\/0012-365X(73)90118-0_BIB4","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.17.3.395","article-title":"An appraisal of some shortest-path algorithms","volume":"17","author":"Dreyfus","year":"1969","journal-title":"Operations Research"},{"issue":"6","key":"10.1016\/0012-365X(73)90118-0_BIB5","first-page":"345","article-title":"Algorithm 97, shortest path","volume":"5","author":"Floyd","year":"1962","journal-title":"Commun. A.C.M."},{"key":"10.1016\/0012-365X(73)90118-0_BIB6","series-title":"Alg\u00e8bre moderne et th\u00e9orie des graphes","author":"Roy","year":"1970"},{"key":"10.1016\/0012-365X(73)90118-0_BIB7","article-title":"A matrix algorithm for solving all shortest routes from a fixed origin in nonnegative networks","author":"Yen","year":"1968","journal-title":"TIMS 15th Intern. Meeting"},{"key":"10.1016\/0012-365X(73)90118-0_BIB8","article-title":"14N3 step algorithm for (i) finding all shortest distances from a fixed origin or (ii) detecting negative loops in N-node general networks","author":"Yen","year":"1969","journal-title":"36th ORSA Meeting"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X73901180?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X73901180?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:27:57Z","timestamp":1555118877000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X73901180"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1973]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1973]]}},"alternative-id":["0012365X73901180"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(73)90118-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1973]]}}}