{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T00:59:38Z","timestamp":1648947578624},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1976,3,1]],"date-time":"1976-03-01T00:00:00Z","timestamp":194486400000},"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":[[1976,3]]},"DOI":"10.1007\/bf02252264","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T16:43:20Z","timestamp":1132073000000},"page":"93-96","source":"Crossref","is-referenced-by-count":2,"title":["Algorithmus 31 Ein Algorithmus zur Bestimmung von Weganzahlen in Netzen"],"prefix":"10.1007","volume":"17","author":[{"given":"D.","family":"Lohse","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02252264_CR1","doi-asserted-by":"crossref","unstructured":"Brucker, P.:R-Netzwerke und Matrixalgorithmen. Computing10 (1972).","DOI":"10.1007\/BF02316913"},{"key":"BF02252264_CR2","doi-asserted-by":"crossref","unstructured":"Hu, T. C.: Revised Matrix Algorithms for Shortest Paths. SIAM J. Appl. Math.15 (1967).","DOI":"10.1137\/0115017"},{"key":"BF02252264_CR3","first-page":"271","volume":"6","author":"U. Pape","year":"1969","unstructured":"Pape, U.: Bibliographie zu: K\u00fcrzeste Wegl\u00e4ngen und Wege in Graphen und Netzwerke. Elektronische Datenverarbeitung6, 271\u2013274 (1969).","journal-title":"Elektronische Datenverarbeitung"},{"key":"BF02252264_CR4","unstructured":"Pape, U.: Zur Implementierung und Wirtschaftlichkeit von Moore-Algorithmen zur Bestimmung k\u00fcrzester Wegl\u00e4ngen in einem Netzwerk. Technische Universit\u00e4t Berlin, Fachbereich 20-Kybernetik, Bericht Nr. 736."},{"key":"BF02252264_CR5","doi-asserted-by":"crossref","unstructured":"Perl, J.: Anwendung von Graphenalgorithmen auf allgemeine Problemklassen. Computing11 (1973).","DOI":"10.1007\/BF02252913"},{"key":"BF02252264_CR6","doi-asserted-by":"crossref","unstructured":"Visotschnig, E.: Ein reduzierter Matrix-Algorithmus zur L\u00f6sung einiger graphentheoretischer Probleme. Computing6 (1970).","DOI":"10.1007\/BF02238808"},{"key":"BF02252264_CR7","doi-asserted-by":"crossref","unstructured":"Weigand, M. M.: Ein leistungsf\u00e4higer Algorithmus zur Bestimmung von K-k\u00fcrzesten Wegen in einem Graphen. Computing12 (1974).","DOI":"10.1007\/BF02293111"}],"container-title":["Computing"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02252264.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02252264\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02252264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T23:38:59Z","timestamp":1586561939000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02252264"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,3]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1976,3]]}},"alternative-id":["BF02252264"],"URL":"https:\/\/doi.org\/10.1007\/bf02252264","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1976,3]]}}}