{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T14:50:50Z","timestamp":1648911050361},"reference-count":14,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1986,3,1]],"date-time":"1986-03-01T00:00:00Z","timestamp":510019200000},"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":10000,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1986,3]]},"DOI":"10.1016\/0166-218x(86)90083-1","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T17:34:03Z","timestamp":1042824843000},"page":"213-221","source":"Crossref","is-referenced-by-count":2,"title":["Allowable processing orders in the accelerated cascade algorithm"],"prefix":"10.1016","volume":"13","author":[{"given":"A.J","family":"Goldman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prasoon","family":"Tiwari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(86)90083-1_BIB1","first-page":"231","article-title":"A modified cascade algorithm for shortest paths","volume":"8","author":"Bilde","year":"1969","journal-title":"Metra"},{"key":"10.1016\/0166-218X(86)90083-1_BIB2","article-title":"Theory of Matrix Algorithms","volume":"13","author":"Brucker","year":"1974"},{"key":"10.1016\/0166-218X(86)90083-1_BIB3","series-title":"Theory of Graphs","first-page":"91","article-title":"All shortest routes in a graph","author":"Dantzig","year":"1967"},{"key":"10.1016\/0166-218X(86)90083-1_BIB4","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/mnsc.14.1.19","article-title":"The cascade algorithm for finding all shortest distances in a directed graph","volume":"14","author":"Farbey","year":"1967","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(86)90083-1_BIB5","first-page":"345","article-title":"Algorithm 97: shortest path","volume":"5","author":"Floyd","year":"1962","journal-title":"Comm. Assoc. Comput. Mach."},{"key":"10.1016\/0166-218X(86)90083-1_BIB6","doi-asserted-by":"crossref","DOI":"10.1016\/0166-218X(86)90083-1","article-title":"Allowable processing orders in the cascade algorithm","author":"Goldman","year":"1983"},{"key":"10.1016\/0166-218X(86)90083-1_BIB7","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/0115017","article-title":"Revised matrix algorithms for shortest paths","volume":"15","author":"Hu","year":"1967","journal-title":"J. SIAM Appl. Math."},{"key":"10.1016\/0166-218X(86)90083-1_BIB8","article-title":"The effect of algebraic structure on the computational complexity of matrix multiplications","author":"Kerr","year":"1970"},{"key":"10.1016\/0166-218X(86)90083-1_BIB9","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0304-3975(77)90056-1","article-title":"Algebraic structures for transitive closure","volume":"4","author":"Lehmann","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0166-218X(86)90083-1_BIB10","first-page":"201","article-title":"A note on the optimality of some all-shortest-path algorithms","volume":"15","author":"Nakamori","year":"1972","journal-title":"J. Oper. Res. Japan"},{"key":"10.1016\/0166-218X(86)90083-1_BIB11","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1287\/opre.9.1.129","article-title":"The shortest route problem \u2014 an addendum","volume":"9","author":"Pandit","year":"1961","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(86)90083-1_BIB12","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/net.3230060303","article-title":"Iterative methods for determining the k shortest paths in a network","volume":"6","author":"Shier","year":"1976","journal-title":"Networks"},{"key":"10.1016\/0166-218X(86)90083-1_BIB13","first-page":"826","article-title":"Sur les m\u00e9thodes matricielles dans la th\u00e9orie des reseaux","volume":"263","author":"Tomescu","year":"1966","journal-title":"C.R. Acad. Sci. Paris"},{"key":"10.1016\/0166-218X(86)90083-1_BIB14","article-title":"Shortest Path Network Algorithms","volume":"18","author":"Yen","year":"1975"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X86900831?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X86900831?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T11:56:34Z","timestamp":1553946994000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X86900831"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,3]]},"references-count":14,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1986,3]]}},"alternative-id":["0166218X86900831"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(86)90083-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1986,3]]}}}