{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T07:15:31Z","timestamp":1762067731297,"version":"build-2065373602"},"reference-count":11,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1992,3]]},"DOI":"10.1016\/0020-0190(92)90048-z","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:38:59Z","timestamp":1027640339000},"page":"169-174","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":10,"title":["Optimal fault-tolerant routings for connected graphs"],"prefix":"10.1016","volume":"41","author":[{"given":"Koichi","family":"Wada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yupin","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kimio","family":"Kawaguchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90048-Z_BIB1","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/0890-5401(87)90063-0","article-title":"Efficient fault tolerant routing in network","volume":"75","author":"Broder","year":"1987","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(92)90048-Z_BIB2","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/0890-5401(87)90031-9","article-title":"A new look at fault tolerant routing","volume":"72","author":"Dolev","year":"1987","journal-title":"Inform. and Comput."},{"year":"1979","series-title":"Graph Algorithms","author":"Evens","key":"10.1016\/0020-0190(92)90048-Z_BIB3"},{"key":"10.1016\/0020-0190(92)90048-Z_BIB4","series-title":"Proc. 17th ACM STOC","first-page":"327","article-title":"Fault tolerance of minimal path routing in a network","author":"Feldman","year":"1985"},{"year":"1969","series-title":"Graph Theory","author":"Harary","key":"10.1016\/0020-0190(92)90048-Z_BIB5"},{"key":"10.1016\/0020-0190(92)90048-Z_BIB6","series-title":"Paper of Technical Group","article-title":"Fault tolerant routings in a k-connected network","author":"Imase","year":"1987"},{"key":"10.1016\/0020-0190(92)90048-Z_BIB7","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0890-5401(88)90016-8","article-title":"The multi-tree approach to reliability in distributed networks","volume":"79","author":"Itai","year":"1988","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(92)90048-Z_BIB8","article-title":"New results in graph routing","author":"Kawaguchi","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(92)90048-Z_BIB9","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0890-5401(87)90010-1","article-title":"On fault tolerant routing in general graph","volume":"74","author":"Peleg","year":"1987","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(92)90048-Z_BIB10","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0020-0190(90)90189-5","article-title":"A linear algorithm for bipartition of biconnected graphs","volume":"33","author":"Suzuki","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(92)90048-Z_BIB11","article-title":"Efficient fault-tolerant fixed routings on (k + 1)-connected diagraphs","volume":"37","author":"Wada","year":"1992","journal-title":"Discrete Appl. Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290048Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290048Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T07:10:31Z","timestamp":1762067431000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290048Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["002001909290048Z"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90048-z","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[1992,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimal fault-tolerant routings for connected graphs","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0020-0190(92)90048-Z","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1992 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}