{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T04:21:29Z","timestamp":1649046089662},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[1974,9,1]],"date-time":"1974-09-01T00:00:00Z","timestamp":147225600000},"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":[[1974,9]]},"DOI":"10.1007\/bf02241718","type":"journal-article","created":{"date-parts":[[2005,11,14]],"date-time":"2005-11-14T15:49:52Z","timestamp":1131983392000},"page":"249-252","source":"Crossref","is-referenced-by-count":2,"title":["\u00dcber die Bestimmung minimaler Wege und Ger\u00fcste in Graphen"],"prefix":"10.1007","volume":"13","author":[{"given":"H. A.","family":"Jung","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02241718_CR1","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1287\/mnsc.6.2.187","volume":"6","author":"G. B. Dantzig","year":"1959","unstructured":"Dantzig, G. B.: On the shortest route through a network. Management Sci.6, 187\u2013190 (1959).","journal-title":"Management Sci."},{"key":"BF02241718_CR2","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1002\/mana.19680360509","volume":"36","author":"H. A. Jung","year":"1968","unstructured":"Jung, H. A.: Wurzelb\u00e4ume und Kantenorientierungen in Graphen. Math. Nachr.36, 351\u2013359 (1968).","journal-title":"Math. Nachr."},{"key":"BF02241718_CR3","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J. B. Kruskal","year":"1956","unstructured":"Kruskal, J. B.: On the shortest spanning subtree of a graph and the travelling salesman problem. Proc. AMS7, 48\u201350 (1956).","journal-title":"Proc. AMS"},{"key":"BF02241718_CR4","first-page":"271","volume":"6","author":"U. Pape","year":"1969","unstructured":"Pape, U.: Eine Bibliographie zu \u201eK\u00fcrzeste Wegl\u00e4ngen und Wege in Graphen und Netzwerken\u201d. Elektronische Datenverarbeitung6, 271\u2013274 (1969).","journal-title":"Elektronische Datenverarbeitung"},{"key":"BF02241718_CR5","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R. C. Prim","year":"1957","unstructured":"Prim, R. C.: Shortest connection networks and some generalization. Bell System Techn. J.36, 1389\u20131401 (1957).","journal-title":"Bell System Techn. J."}],"container-title":["Computing"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02241718.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02241718\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02241718","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T19:15:46Z","timestamp":1557861346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02241718"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,9]]},"references-count":5,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1974,9]]}},"alternative-id":["BF02241718"],"URL":"https:\/\/doi.org\/10.1007\/bf02241718","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1974,9]]}}}