{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:14Z","timestamp":1725663254521},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540126898"},{"type":"electronic","value":"9783540386827"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1983]]},"DOI":"10.1007\/3-540-12689-9_113","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:52:19Z","timestamp":1330192339000},"page":"302-309","source":"Crossref","is-referenced-by-count":1,"title":["A single source shortest path algorithm for graphs with separators"],"prefix":"10.1007","author":[{"given":"K.","family":"Mehlhorn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B. H.","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R.E. Bellman","year":"1958","unstructured":"Bellman R.E. On a Routing Problem Quart. Appl. Math. 16 (1958) pp. 87\u201390","journal-title":"Quart. Appl. Math."},{"key":"25_CR2","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra E.W. A Note on two Problems in Connection with Graphs Num. Math. Vol. 1 (1959) pp. 269\u2013271","journal-title":"Num. Math."},{"key":"25_CR3","first-page":"345","volume":"5","author":"J. Edmonds","year":"1962","unstructured":"Edmonds J., Karp R.M. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems J. ACM 5 (1962) p. 345","journal-title":"J. ACM"},{"key":"25_CR4","unstructured":"Lipton R., Tarjan R.E. A Separator Theorem for Planar Graphs Waterloo Conference on Theoretical Comp. Science Aug.77 pp. 1\u201310"},{"key":"25_CR5","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"F.W. Floyd","year":"1962","unstructured":"Floyd F.W. Algorithm 97: Shortest Path C. ACM 5 (1962) p. 345","journal-title":"C. ACM"}],"container-title":["Lecture Notes in Computer Science","Foundations of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-12689-9_113.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:50:21Z","timestamp":1619556621000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-12689-9_113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"ISBN":["9783540126898","9783540386827"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-12689-9_113","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1983]]}}}