{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:37:06Z","timestamp":1725482226056},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540667315"},{"type":"electronic","value":"9783540467847"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46784-x_20","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T12:02:55Z","timestamp":1175774575000},"page":"191-201","source":"Crossref","is-referenced-by-count":1,"title":["An Optimal Fault-Tolerant Routing for Triconnected Planar Graphs"],"prefix":"10.1007","author":[{"given":"Koichi","family":"Wada","sequence":"first","affiliation":[]},{"given":"Yoriyuki","family":"Nagata","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/0890-5401(87)90063-0","volume":"75","author":"A. Broder","year":"1987","unstructured":"A. Broder, D. Dolev, M. Fischer and B. Simons: \u201cEfficient Fault Tolerant Routing in Network,\u201d Information and Computation 75,52\u201364(1987). 191","journal-title":"Information and Computation"},{"key":"20_CR2","doi-asserted-by":"publisher","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 Computation 72,180\u2013196(1987). 191","journal-title":"Information and Computation"},{"doi-asserted-by":"crossref","unstructured":"P. Feldman: \u201cFault Tolerance of Minimal Path Routing in a Network,\u201d Proc. 17th ACM STOC,pp.327\u2013334(1985). 191","key":"20_CR3","DOI":"10.1145\/22145.22181"},{"key":"20_CR4","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). 192"},{"issue":"1","key":"20_CR5","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF02086606","volume":"16","author":"G. Kant","year":"1996","unstructured":"G. Kant: \u201cDrawing Planar Graphs Using the Canonical Ordering,\u201d Algorithmica, 16, 1, 4\u201332 (1996). 192, 195, 196","journal-title":"Algorithmica"},{"issue":"2","key":"20_CR6","doi-asserted-by":"publisher","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). 191","journal-title":"Information and Computation"},{"key":"20_CR7","doi-asserted-by":"publisher","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 Computation 74,33\u201349(1987). 191","journal-title":"Information and Computation"},{"key":"20_CR8","doi-asserted-by":"publisher","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 FixedR outings on (k + 1)-connectedDi graphs,\u201d Discrete Applied Mathematics, 37\/38, 539\u2013552 (1992). 191","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"20_CR9","doi-asserted-by":"publisher","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). 192","journal-title":"Information Processing Letters"},{"unstructured":"K. Wada, W. Chen, Y. Luo and K. Kawaguchi: \u201cOptimal Fault-Tolerant ATM-routings for Biconnected Graphs,\u201d The 23rd International Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 1335, 354\u2013367 (1997). 191, 192","key":"20_CR10"}],"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\/3-540-46784-X_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T07:41:05Z","timestamp":1550302865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46784-X_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540667315","9783540467847"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-46784-x_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}