{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:33:59Z","timestamp":1699835639692},"reference-count":4,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":9080,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1981,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper is concerned with the problem of defining <jats:italic>K<\/jats:italic> multiple paths between pairs of nodes in a network. The treatment presented here is on a theoretical level, although the problem is motivated by a practical scheme for message routing in store\u2010and\u2010forward packet switched computer networks. Theorems are presented which offer readily testable sufficient conditions on the topology of a network which guarantee the existence of at least one set of paths under consideration. The proof of this theorem provides a generalized systematic method for constructing these paths if the sufficient conditions are met.<\/jats:p>","DOI":"10.1002\/net.3230110411","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T12:56:28Z","timestamp":1178888188000},"page":"401-411","source":"Crossref","is-referenced-by-count":2,"title":["Some theoretical results in multiple path definition in networks"],"prefix":"10.1002","volume":"11","author":[{"given":"Franklin H.","family":"Moss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip M.","family":"Merlin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"R. R.JuenemanandG. S.Kerr \u201cExplicit Path Routing in Communication Networks \u201d ICCC 76 Toronto Canada."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1147\/sj.182.0298"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230060303"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230110411","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230110411","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T11:47:01Z","timestamp":1699789621000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230110411"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,12]]},"references-count":4,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1981,12]]}},"alternative-id":["10.1002\/net.3230110411"],"URL":"https:\/\/doi.org\/10.1002\/net.3230110411","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,12]]}}}