{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:07:49Z","timestamp":1699834069630},"reference-count":6,"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":10541,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1977,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Decomposition algorithms have been proposed for finding the shortest paths between all pairs of nodes in a large network. The central idea is to treat the large network as several small networks overlapping each other. When the small networks overlap each other linearly, algorithms have been proposed to treat each small network individually. The present note treats the case of small networks overlapping each other like a tree.<\/jats:p>","DOI":"10.1002\/net.3230070402","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T06:18:25Z","timestamp":1178864305000},"page":"289-296","source":"Crossref","is-referenced-by-count":2,"title":["Tree decomposition algorithm for large networks"],"prefix":"10.1002","volume":"7","author":[{"given":"W. J.","family":"Blewett","sequence":"first","affiliation":[]},{"given":"T. C.","family":"Hu","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"Goto S. \u201cA New Shortest Path Updating Algorithm \u201dERL\u2010M588 Electronics Research Labs Berkeley May1976 submitted for publication."},{"key":"e_1_2_1_3_2","unstructured":"Goto S. T.OhtsukiandT.Yoshimura \u201cA Shortest Path Calculation Program Based on Code Generation Technique \u201d13th Annual Allerton Conf. on Circuit and System Theory submitted toIEEE Trans. C.A.S."},{"key":"e_1_2_1_4_2","volume-title":"Integer Programming and Network Flows","author":"Hu T. C.","year":"1969"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1147\/rd.134.0387"},{"key":"e_1_2_1_6_2","unstructured":"Iri M.andM.Nakamori \u201cPath Sets Operator Semigroups and Shortest Path Algorithms on a Network \u201dRAAG Research Notes Third Series No. 185 October1972."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264289"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230070402","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230070402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T09:51:16Z","timestamp":1699782676000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230070402"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,12]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1977,12]]}},"alternative-id":["10.1002\/net.3230070402"],"URL":"https:\/\/doi.org\/10.1002\/net.3230070402","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1977,12]]}}}