{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,7]],"date-time":"2023-10-07T13:13:41Z","timestamp":1696684421675},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1972,9,1]],"date-time":"1972-09-01T00:00:00Z","timestamp":84153600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1972,9]]},"DOI":"10.1007\/bf02316913","type":"journal-article","created":{"date-parts":[[2006,3,14]],"date-time":"2006-03-14T16:16:39Z","timestamp":1142352999000},"page":"271-283","source":"Crossref","is-referenced-by-count":9,"title":["\u211c-Netzwerke und Matrixalgorithmen"],"prefix":"10.1007","volume":"10","author":[{"given":"P.","family":"Brucker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02316913_CR1","volume-title":"Theorie des graphes et ses applications","author":"C. Berge","year":"1962","unstructured":"Berge, C.: Theorie des graphes et ses applications. Paris: Dunod. Englische \u00dcbersetzung vonA. Doing, London: Methuen. 1962."},{"key":"BF02316913_CR2","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1093\/imamat\/7.3.273","volume":"7","author":"B. A. Car\u00e9","year":"1971","unstructured":"Car\u00e9, B. A.: An algebra for network routing problems. Journal of the Institute of Mathematics and its Applications7, 273\u2013293 (1971).","journal-title":"Journal of the Institute of Mathematics and its Applications"},{"key":"BF02316913_CR3","doi-asserted-by":"crossref","unstructured":"Dantzig, G. B.: All shortest routes in a graph, in: Theory of graphs, International Symposium, Rom, 1966, S. 91\u201392. New York: Gorden & Breach.","DOI":"10.21236\/AD0646551"},{"key":"BF02316913_CR4","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"R. W. Floyd","year":"1962","unstructured":"Floyd, R. W.: Algorithm 97, shortest path. Communications of the A. C. M.5, 345 (1962).","journal-title":"Communications of the A. C. M."},{"key":"BF02316913_CR5","unstructured":"Hammer, R. L.: Pseudo-boolean remarks on balanced graphs. Operations Research, Statistics and Economics Mineograph Series No. 34, University of Montreal. 1969."},{"key":"BF02316913_CR6","volume-title":"Structural models. An introduction to the theory of directed graphs","author":"F. Harary","year":"1965","unstructured":"Harary, F., R. Z. Norman, andD. Cartwright: Structural models. An introduction to the theory of directed graphs. New York-London-Sydney: J. Wiley. 1965."},{"key":"BF02316913_CR7","unstructured":"Murchland, J. D.: A new method for finding all elementary paths in a complete directed graph. Report LBS-TNT-25, Transport network theory unit, London Graduate School of Business Studies (March 1966)."},{"key":"BF02316913_CR8","first-page":"11","volume":"9","author":"S. Warshall","year":"1962","unstructured":"Warshall, S.: A theorem on boolean matrices. J. A. C. M.9, 11\u201318 (1962).","journal-title":"J. A. C. M."}],"container-title":["Computing"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02316913.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02316913\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02316913","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T13:57:28Z","timestamp":1558015048000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02316913"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1972,9]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1972,9]]}},"alternative-id":["BF02316913"],"URL":"https:\/\/doi.org\/10.1007\/bf02316913","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1972,9]]}}}