{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:25:30Z","timestamp":1753439130468},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[1971,3,1]],"date-time":"1971-03-01T00:00:00Z","timestamp":36633600000},"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":[[1971,3]]},"DOI":"10.1007\/bf02234053","type":"journal-article","created":{"date-parts":[[2005,10,21]],"date-time":"2005-10-21T02:29:41Z","timestamp":1129861781000},"page":"171-181","source":"Crossref","is-referenced-by-count":5,"title":["Die Bestimmung k\u00fcrzester Pfade in Graphen und passende Datenstrukturen"],"prefix":"10.1007","volume":"8","author":[{"given":"D.","family":"Braess","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02234053_CR1","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/BF02277215","volume":"3","author":"R. Albrecht","year":"1968","unstructured":"Albrecht, R.: Bestimmung minimaler Pfade in endlichen, gerichteten, bewerteten Graphen. Computing3, 184\u2013193 (1968).","journal-title":"Computing"},{"key":"BF02234053_CR2","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/BF02236544","volume":"4","author":"R. Albrecht","year":"1969","unstructured":"Albrecht, R., undE. Visotschnig: ALGOL-Prozeduren zu den modifizierten Algorithmen nachMinty undMoore. Computing4, 76\u201381 (1969).","journal-title":"Computing"},{"key":"BF02234053_CR3","unstructured":"Berge, C.: La Th\u00e9orie des Graphes, Paris 1958."},{"key":"BF02234053_CR4","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1145\/363269.363610","volume":"12","author":"R. B. Dial","year":"1969","unstructured":"Dial, R. B.: Shortest- path forest with topological ordering. Algorithmus 360. Communications ACM12, 632\u2013633 (1969).","journal-title":"Communications ACM"},{"key":"BF02234053_CR5","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. Numer. Math.1, 269\u2013271 (1959).","journal-title":"Numer. Math."},{"key":"BF02234053_CR6","first-page":"10","volume":"2","author":"H. Falkenhausen v.","year":"1964","unstructured":"Falkenhausen, H. v.: Zur Numerischen Behandlung von Netzen auf Rechenautomaten. Vortrag auf der AKOR-Tagung, Linz, 2. 10. 1964.","journal-title":"Linz"},{"key":"BF02234053_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-95121-3","volume-title":"Graphentheoretische Methoden und ihre Anwendungen","author":"W. Kn\u00f6del","year":"1969","unstructured":"Kn\u00f6del, W.: Graphentheoretische Methoden und ihre Anwendungen. Berlin-Heidelberg-New York: Springer. 1969."},{"key":"BF02234053_CR8","unstructured":"Knuth, D.: The Art of Computer Programming. Vol. 1 (Kapitel 2). Fundamental Algorithms. Addison-Wesley."},{"key":"BF02234053_CR9","first-page":"105","volume":"3","author":"U. Pape","year":"1969","unstructured":"Pape, U.: K\u00fcrzeste Pfade in asymmetrischen Netzwerken zwischen einem festen Knoten und beliebigen Knoten. Elektronische Datenverarbeitung3, 105\u2013114 (1969).","journal-title":"Elektronische Datenverarbeitung"},{"key":"BF02234053_CR10","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1287\/opre.8.2.224","volume":"8","author":"M. Pollack","year":"1960","unstructured":"Pollack, M., andW. Wiebenson: Solution of the shortest route problem \u2014 a review. Operation Research8, 224\u2013230 (1960).","journal-title":"Operation Research"},{"key":"BF02234053_CR11","volume-title":"Lineares Optimieren","author":"W. Vogel","year":"1967","unstructured":"Vogel, W.: Lineares Optimieren. Leipzig: Akademische Verlagsgesellschaft 1967."}],"container-title":["Computing"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02234053.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02234053\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02234053","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T12:45:37Z","timestamp":1557924337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02234053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1971,3]]},"references-count":11,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1971,3]]}},"alternative-id":["BF02234053"],"URL":"https:\/\/doi.org\/10.1007\/bf02234053","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1971,3]]}}}