{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:12:52Z","timestamp":1725455572769},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637578"},{"type":"electronic","value":"9783540696438"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0024510","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T07:30:56Z","timestamp":1132385456000},"page":"354-367","source":"Crossref","is-referenced-by-count":1,"title":["Optimal fault-tolerant ATM-routings for biconnected graphs"],"prefix":"10.1007","author":[{"given":"Koichi","family":"Wada","sequence":"first","affiliation":[]},{"given":"Wei","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Yupin","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Kimio","family":"Kawaguchi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"29_CR1","unstructured":"B.Bollob\u00e1s: Extremal graph theory, Academic Press, 172(1978)."},{"key":"29_CR2","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/0890-5401(87)90063-0","volume":"75","author":"A. Broder","year":"1987","unstructured":"A.Broder, D.Dolev, M.Fischerand B.Simons: \u201cEfficient fault tolerant routing in network,\u201d Information and Computation75,52\u201364 (1987).","journal-title":"Information and Computation"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"I.Cidon, O.Gerstel and S.Zaks: \u201cA scalable approach to routing in ATM networks,\u201d Proc. 8th International Workshop on Distributed Algorithms, LNCS 859, 209\u2013222 (1994).","DOI":"10.1007\/BFb0020435"},{"key":"29_CR4","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/0890-5401(87)90031-9","volume":"72","author":"D. Dolev","year":"1987","unstructured":"D.Dolev, J.Halpern, B.Simons and H.Strong: \u201cA new look at fault tolerant routing,\u201d Information and Computation72,180\u2013196 (1987).","journal-title":"Information and Computation"},{"key":"29_CR5","unstructured":"S. Evens: Graph algorithms, Computer Science Press, Potomac, Maryland(1979)."},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"P.Feldman: \u201cFault tolerance of minimal path routing in a network,in Proc. 17th ACM STOC,pp,327\u2013334(1985).","DOI":"10.1145\/22145.22181"},{"key":"29_CR7","unstructured":"L.G\u00e7asieniec, E.Kranakis, D. Krizanc and A.Pelc: \u201cMinimizing Congestion of Layouts for ATM Networks with Faulty Links,\u201d Proc. The 21st International Symposium on Mathematical Foundations of Computer Science, LNCS 1113, 372\u2013381 (1996)."},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"O.Gerstel, A. Wool and S.Zaks: \u201cOptimal Layouts on a Chain ATM Network,\u201d Proc. The 3rd Annual European Symposium on Algorithms, LNCS 979, 508\u2013522 (1995).","DOI":"10.1007\/3-540-60313-1_167"},{"key":"29_CR9","unstructured":"O.Gerstel and S.Zaks: \u201cThe Virtual Path Layout roblem in Fast Networks,\u201d Proc. 13th ACM Symposium on Principles of Distributed Computing, 235\u2013243 (1994)."},{"key":"29_CR10","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph theory","author":"F. Harary","year":"1969","unstructured":"F.Harary, Graph theory, Addison-Wesley, Reading, MA(1969)."},{"key":"29_CR11","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0890-5401(88)90016-8","volume":"79","author":"A. ItaiO","year":"1988","unstructured":"A. ItaiO. and M. Rodeh: \u201cThe multi-tree approach to reliability in distributed networks,\u201d Information and Computation 79,43\u201359 (1988).","journal-title":"Information and Computation"},{"issue":"2","key":"29_CR12","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1006\/inco.1993.1053","volume":"106","author":"K. Kawaguchi","year":"1993","unstructured":"K.Kawaguchi and K.Wada: \u201cNew results in graph routing,\u201d Information and Computation, 106, 2, 203\u2013233 (1993).","journal-title":"Information and Computation"},{"key":"29_CR13","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0169-7552(92)90114-6","volume":"24","author":"J.Y. Boudec Le","year":"1992","unstructured":"J.Y.Le Boudec: \u201cThe Asynchronous Transfer Mode:A Tutorial,\u201d Computer Networks and ISDN Systems, 24, 279\u2013309 (1992).","journal-title":"Computer Networks and ISDN Systems"},{"issue":"5\/6","key":"29_CR14","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/BF01758778","volume":"7","author":"H. Nagamochi","year":"1992","unstructured":"H.Nagamochi and T.Ibaraki: \u201cA linear-time algorithm for finding a sparse kconnected spanning subgraph of a k-connected graph,\u201d Algorithmica, 7, 5\/6, 583\u2013596 (1992).","journal-title":"Algorithmica"},{"key":"29_CR15","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0890-5401(87)90010-1","volume":"74","author":"D. Peleg","year":"1987","unstructured":"D.Peleg and B.Simons: \u201cOn fault tolerant routing in general graph,\u201d Information and Computation74,33\u201349 (1987).","journal-title":"Information and Computation"},{"issue":"5","key":"29_CR16","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0020-0190(90)90189-5","volume":"33","author":"H. Suzuki","year":"1990","unstructured":"H.Suzuki, N.Takahashi and T.Nishizeki: \u201cA linear algorithm for bipartition of biconnected graphs,\u201d Information Processing Letters, 33, 5, 227\u2013231 (1990).","journal-title":"Information Processing Letters"},{"key":"29_CR17","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/0166-218X(92)90157-6","volume":"37\/38","author":"K. Wada","year":"1992","unstructured":"K.Wada and K.Kawaguchi: \u201cEfficient fault-tolerant fixed routings on (k + 1)connected digraphs,\u201d Discrete Applied Mathematics, 37\/38, 539\u2013552 (1992).","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"29_CR18","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0020-0190(92)90048-Z","volume":"41","author":"K. Wada","year":"1992","unstructured":"K.Wada, Y.Luo and K.Kawaguchi: \u201cOptimal Fault-tolerant routings for Connected Graphs,\u201d Information Processing Letters, 41, 3, 169\u2013174 (1992).","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024510","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T22:31:36Z","timestamp":1549319496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024510"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637578","9783540696438"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0024510","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}