{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T17:41:35Z","timestamp":1697910095168},"reference-count":2,"publisher":"Wiley","issue":"11","license":[{"start":{"date-parts":[[2007,3,21]],"date-time":"2007-03-21T00:00:00Z","timestamp":1174435200000},"content-version":"vor","delay-in-days":7384,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp; Computers in Japan"],"published-print":{"date-parts":[[1987,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Improving the reliability of information transmission in communications networks and computer networks economically and efficiently is an important subject. A communications network (computer network) is represented by a graph whose nodes and edges correspond to switching offices (computers) and links, respectively, and communication between two nodes is made through a path in a graph. Routing is defined as the determination of a communication path between two nodes in a network. The diameter of the surviving route graph, where two nonfaulty nodes are connected by an edge if there are no faults on the route between them, could be one of the fault\u2010tolerant measures for a routing. In this paper, for the routing of any (<jats:italic>k<\/jats:italic> + 1)\u2010node connected graph <jats:italic>G<\/jats:italic> defined by Dolev et al., we discuss the upper and lower bounds of the diameter of the surviving route graph for any fault. We can also construct a routing for (<jats:italic>k<\/jats:italic> + 1)\u2010edge connected graph <jats:italic>G<\/jats:italic> such that the diameter of the surviving route graph is constant for any edge faults.<\/jats:p>","DOI":"10.1002\/scj.4690181106","type":"journal-article","created":{"date-parts":[[2007,7,7]],"date-time":"2007-07-07T13:03:12Z","timestamp":1183813392000},"page":"50-60","source":"Crossref","is-referenced-by-count":0,"title":["Fault\u2010tolerant network routings for (k + 1)\u2010node connected and (k + 1)\u2010edge connected graphs"],"prefix":"10.1002","volume":"18","author":[{"given":"Koichi","family":"Wada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kimio","family":"Kawaguchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yupin","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2007,3,21]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","unstructured":"A.Broder D.Dolev M.FischerandB.Simons.Efficient fault tolerant routing in network Proc. of ACM 16th STOC pp.536\u2013541(1984).","DOI":"10.1145\/800057.808724"},{"key":"e_1_2_1_3_2","doi-asserted-by":"crossref","unstructured":"D.Dolev J.Halpern B.SimonsandR.Strong.A new look at fault\u2010tolerant network routing Proc. of ACM 16th STOC pp.526\u2013535(1984).","DOI":"10.1145\/800057.808723"}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690181106","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690181106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T23:40:48Z","timestamp":1697845248000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690181106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,1]]},"references-count":2,"journal-issue":{"issue":"11","published-print":{"date-parts":[[1987,1]]}},"alternative-id":["10.1002\/scj.4690181106"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690181106","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,1]]}}}