{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:16:53Z","timestamp":1725556613475},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131356"},{"type":"electronic","value":"9783642131363"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13136-3_27","type":"book-chapter","created":{"date-parts":[[2010,5,25]],"date-time":"2010-05-25T22:20:16Z","timestamp":1274826016000},"page":"264-274","source":"Crossref","is-referenced-by-count":1,"title":["Cluster-Fault-Tolerant Routing in Burnt Pancake Graphs"],"prefix":"10.1007","author":[{"given":"Nagateru","family":"Iwasawa","sequence":"first","affiliation":[]},{"given":"Tatsuro","family":"Watanabe","sequence":"additional","affiliation":[]},{"given":"Tatsuya","family":"Iwasaki","sequence":"additional","affiliation":[]},{"given":"Keiichi","family":"Kaneko","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0166-218X(94)00009-3","volume":"61","author":"D.S. Cohen","year":"1995","unstructured":"Cohen, D.S., Blum, M.: On the problem of sorting burnt pancakes. Discrete Applied Mathematics\u00a061, 105\u2013120 (1995)","journal-title":"Discrete Applied Mathematics"},{"key":"27_CR2","unstructured":"Iwasaki, T., Kaneko, K.: A fault-tolerant routing algorithm of burnt pancake graphs. In: Proc. 2009 Int\u2019l Conf. Parallel and Distributed Processing Techniques and Applications, pp. 307\u2013313 (2009)"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Kaneko, K.: An algorithm for node-to-node disjoint paths problem in burnt pancake graphs. IEICE Trans. Inf. and Systems\u00a0E90-D(1), 306\u2013313 (2007)","DOI":"10.1093\/ietisy\/e90-1.1.306"},{"issue":"12","key":"27_CR4","first-page":"2588","volume":"86","author":"K. Kaneko","year":"2003","unstructured":"Kaneko, K.: An algorithm for node-to-set disjoint paths problem in burnt pancake graphs. IEICE Trans. Inf. and Systems\u00a0E86-D(12), 2588\u20132594 (2003)","journal-title":"IEICE Trans. Inf. and Systems"},{"issue":"4","key":"27_CR5","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1093\/ietisy\/e90-d.4.716","volume":"90","author":"K. Kaneko","year":"2007","unstructured":"Kaneko, K.: Hamiltonian cycles and hamiltonian paths in faulty burnt pancake graphs. IEICE Trans. Inf. and Systems\u00a0E90-D(4), 716\u2013721 (2007)","journal-title":"IEICE Trans. Inf. and Systems"},{"key":"27_CR6","unstructured":"Kaneko, K., Sawada, N., Peng, S.: Cluster fault-tolerant routing in pancake graphs. In: Proc. 19th IASTED Conf. Parallel and Distributed Computing and Systems, pp. 423\u2013428 (2007)"},{"issue":"1","key":"27_CR7","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/(SICI)1097-0037(200001)35:1<83::AID-NET7>3.0.CO;2-D","volume":"35","author":"Q.P. Gu","year":"2000","unstructured":"Gu, Q.P., Peng, S.: Cluster fault-tolerant routing in star graphs. Networks\u00a035(1), 83\u201390 (2000)","journal-title":"Networks"},{"issue":"7","key":"27_CR8","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1093\/comjnl\/39.7.626","volume":"39","author":"Q.P. Gu","year":"1996","unstructured":"Gu, Q.P., Peng, S.: Optimal algorithms for node-to-node fault tolerant routing in hypercubes. The Computer Journal\u00a039(7), 626\u2013629 (1996)","journal-title":"The Computer Journal"},{"issue":"4","key":"27_CR9","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1109\/12.21148","volume":"38","author":"S.B. Akers","year":"1989","unstructured":"Akers, S.B., Krishnamurthy, B.: A group-theoretic model for symmetric interconnection networks. IEEE Trans. Computers\u00a038(4), 555\u2013566 (1989)","journal-title":"IEEE Trans. Computers"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(79)90068-2","volume":"27","author":"W.H. Gates","year":"1979","unstructured":"Gates, W.H., Papadimitriou, H.: Bounds for sorting by prefix reversal. Discrete Mathematics\u00a027, 47\u201357 (1979)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13136-3_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:02:01Z","timestamp":1606186921000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13136-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131356","9783642131363"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13136-3_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}