{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T00:10:13Z","timestamp":1777162213615,"version":"3.51.4"},"reference-count":10,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":11971,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1974,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Routes between two given nodes of a network are called diversified if they are node\u2010disjoint, except at the terminals. Diversified routes are required for reliability in communication, and an additional criterion is that their total cost, assumed to be the sum of individual arc lengths or costs, is minimum. An algorithm and related theory is described for a general number K of node\u2010disjoint paths with minimum total length. The algorithm applies shortest path labeling algorithms familiar in the literature. K node\u2010disjoint paths are found in K iterations of a single shortest path algorithm.<\/jats:p>","DOI":"10.1002\/net.3230040204","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T01:27:26Z","timestamp":1178846846000},"page":"125-145","source":"Crossref","is-referenced-by-count":514,"title":["Disjoint paths in a network"],"prefix":"10.1002","volume":"4","author":[{"given":"J. W.","family":"Suurballe","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400875184"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400884179"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207176708921826"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01935329"},{"key":"e_1_2_1_6_2","unstructured":"Takamori H. \u201cEdge\u2010Disjoint Routes and Blocking Routes Problems \u201d Department of Statistics and Operations Research University of Pennsylvania November1969."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"e_1_2_1_8_2","unstructured":"Clark C. E. private communication."},{"key":"e_1_2_1_9_2","unstructured":"Ford Jr. L. R. \u201cNetwork Flow Theory \u201d Rand Corporation Paper P\u2010923 July 14 1956."},{"key":"e_1_2_1_10_2","first-page":"46","volume-title":"Graphs and Networks","author":"Price W. L.","year":"1971"},{"key":"e_1_2_1_11_2","doi-asserted-by":"crossref","unstructured":"Dijkstra E. W. \u201cA Note on Two Problems in Connexion with Graphs \u201dNumerische Mathematik 1959 pp.269\u2013271.","DOI":"10.1007\/BF01386390"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230040204","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230040204","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T14:19:11Z","timestamp":1699798751000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230040204"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,1]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1974,1]]}},"alternative-id":["10.1002\/net.3230040204"],"URL":"https:\/\/doi.org\/10.1002\/net.3230040204","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1974,1]]}}}