{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T14:22:54Z","timestamp":1648650174462},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1974,10,1]],"date-time":"1974-10-01T00:00:00Z","timestamp":149817600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Zeitschrift f\u00fcr Operations Research"],"published-print":{"date-parts":[[1974,10]]},"DOI":"10.1007\/bf02026598","type":"journal-article","created":{"date-parts":[[2005,8,10]],"date-time":"2005-08-10T17:13:54Z","timestamp":1123694034000},"page":"177-180","source":"Crossref","is-referenced-by-count":0,"title":["A decomposition algorithm for shortest paths in a network with many strongly connected components"],"prefix":"10.1007","volume":"18","author":[{"given":"P.","family":"Brucker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02026598_CR1","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"6","author":"R. W. Floyd","year":"1962","unstructured":"Floyd, R. W.: Algorithm 97: Shortest Path, Communication of ACM6, 345, 1962.","journal-title":"Communication of ACM"},{"key":"BF02026598_CR2","first-page":"91","volume":"16","author":"T. C. Hu","year":"1968","unstructured":"Hu, T. C.: Decomposition Algorithm for Shortest Paths in a Network, J. ORSA16, 91\u2013102, 1968.","journal-title":"J. ORSA"},{"key":"BF02026598_CR3","volume-title":"Integer Programming and Networks Flows","author":"T. C. Hu","year":"1970","unstructured":"\u2014: Integer Programming and Networks Flows, Addison-Wesley, Reading, Massachusetts 1970."},{"key":"BF02026598_CR4","volume-title":"The Art of Computer Programming, Vol. 1","author":"D. E. Knuth","year":"1969","unstructured":"Knuth, D. E.: The Art of Computer Programming, Vol. 1, Addison-Wesley, Reading, Massachusetts 1969."},{"key":"BF02026598_CR5","unstructured":"Murchland, J. D.: A New Method for Finding All Elementary Paths in a Complete Directed Graph, Transport Network Theory Unit, London School of Economics, Report LSE-TNT-22, 1965."},{"key":"BF02026598_CR6","doi-asserted-by":"crossref","unstructured":"Tarjan, R.: Depth-first Search and Linear Graph Algorithms (Working paper) Computer Science Department, Stanford University 1971.","DOI":"10.1109\/SWAT.1971.10"}],"container-title":["Zeitschrift f\u00fcr Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02026598.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02026598\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02026598","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T20:47:37Z","timestamp":1586378857000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02026598"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,10]]},"references-count":6,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1974,10]]}},"alternative-id":["BF02026598"],"URL":"https:\/\/doi.org\/10.1007\/bf02026598","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1974,10]]}}}