{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:34:23Z","timestamp":1725550463233},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540297697"},{"type":"electronic","value":"9783540321002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11576235_50","type":"book-chapter","created":{"date-parts":[[2005,10,18]],"date-time":"2005-10-18T15:32:46Z","timestamp":1129649566000},"page":"479-490","source":"Crossref","is-referenced-by-count":2,"title":["Container Problem in Burnt Pancake Graphs"],"prefix":"10.1007","author":[{"given":"N.","family":"Sawada","sequence":"first","affiliation":[]},{"given":"Y.","family":"Suzuki","sequence":"additional","affiliation":[]},{"given":"K.","family":"Kaneko","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"50_CR1","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. Comput.\u00a038(4), 555\u2013566 (1989)","journal-title":"IEEE Trans. Comput."},{"key":"50_CR2","doi-asserted-by":"crossref","unstructured":"Akl, S.G., Qiu, K.: Parallel minimum spanning forest algorithms on the star and pancake interconnection networks. In: Proc. of Joint Conf. Vector and Parallel Processing, pp. 565\u2013570 (1992)","DOI":"10.1007\/3-540-55895-0_456"},{"issue":"1","key":"50_CR3","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0167-8191(93)90107-V","volume":"19","author":"S.G. Akl","year":"1993","unstructured":"Akl, S.G., Qiu, K.: A novel routing scheme on the star and pancake interconnection networks and its applications. Parallel Computing\u00a019(1), 95\u2013101 (1993)","journal-title":"Parallel Computing"},{"issue":"4","key":"50_CR4","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1002\/net.3230230403","volume":"23","author":"S.G. Akl","year":"1993","unstructured":"Akl, S.G., Qiu, K., Stojmenovi\u0107, I.: Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry. Networks\u00a023(4), 215\u2013226 (1993)","journal-title":"Networks"},{"issue":"12","key":"50_CR5","doi-asserted-by":"publisher","first-page":"1292","DOI":"10.1109\/71.553290","volume":"7","author":"P. Berthom\u00e9","year":"1996","unstructured":"Berthom\u00e9, P., Ferreira, A., Perennes, S.: Optimal information dissemination in star and pancake networks. IEEE Trans. Parallel and Distributed Systems\u00a07(12), 1292\u20131300 (1996)","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"issue":"5","key":"50_CR6","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1109\/71.159045","volume":"3","author":"P.F. Corbett","year":"1992","unstructured":"Corbett, P.F.: Rotator graphs: An efficient topology for point-to-point multiprocessor networks. IEEE Trans. Parallel and Distributed Systems\u00a03(5), 622\u2013626 (1992)","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"50_CR7","doi-asserted-by":"crossref","unstructured":"Dietzfelbinger, M., Madhavapeddy, S., Sudborough, I.H.: Three disjoint path paradigms in star networks. In: Proc. IEEE SPDP, pp. 400\u2013406 (1991)","DOI":"10.1109\/SPDP.1991.218213"},{"issue":"6","key":"50_CR8","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0020-0190(93)90043-9","volume":"45","author":"L. Garfgano","year":"1993","unstructured":"Garfgano, L., Vaccaro, U., Vozella, A.: Fault tolerant routing in the star and pancake interconnection networks. IPL\u00a045(6), 315\u2013320 (1993)","journal-title":"IPL"},{"key":"50_CR9","doi-asserted-by":"crossref","unstructured":"Gardner, L., Miller, Z., Pritikin, D., Sudborough, I.H.: Embedding hypercubes into pancake, cycle prefix and substring reversal networks. In: Proc. 28th Annual Hawaii Int\u2019l Conf. System Sciences, pp. 537\u2013545 (1995)","DOI":"10.1109\/HICSS.1995.375503"},{"key":"50_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"},{"issue":"4","key":"50_CR11","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0020-0190(97)00059-8","volume":"62","author":"Q.-P. Gu","year":"1997","unstructured":"Gu, Q.-P., Peng, S.: Node-to-set disjoint paths problem in star graphs. IPL\u00a062(4), 201\u2013207 (1997)","journal-title":"IPL"},{"issue":"4","key":"50_CR12","first-page":"477","volume":"79","author":"Y. Hamada","year":"1996","unstructured":"Hamada, Y., Bao, F., Mei, A., Igarashi, Y.: Nonadaptive fault-tolerant file transmission in rotator graphs. IEICE Trans. Fundamentals\u00a0E79-A(4), 477\u2013782 (1996)","journal-title":"IEICE Trans. Fundamentals"},{"issue":"9","key":"50_CR13","first-page":"1155","volume":"84","author":"K. Kaneko","year":"2001","unstructured":"Kaneko, K., Suzuki, Y.: An algorithm for node-to-set disjoint paths problem in rotator graphs. IEICE Trans. Information and Systems\u00a0 E84-D(9), 1155\u20131163 (2001)","journal-title":"IEICE Trans. Information and Systems"},{"issue":"12","key":"50_CR14","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. Information and Systems\u00a0 E86-D(12), 2588\u20132594 (2003)","journal-title":"IEICE Trans. Information and Systems"},{"key":"50_CR15","doi-asserted-by":"crossref","unstructured":"Madhavapeddy, S., Sudborough, I.H.: A topological property of hypercubes \u2014 node disjoint paths. In: Proc. IEEE SPDP, pp. 532\u2013539 (1990)","DOI":"10.1109\/SPDP.1990.143599"},{"key":"50_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1007\/3-540-54029-6_184","volume-title":"Advances in Computing and Information - ICCI \u201991","author":"K. Qiu","year":"1991","unstructured":"Qiu, K., Meijer, H., Akl, S.G.: Parallel routing and sorting on the pancake network. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds.) ICCI 1991. LNCS, vol.\u00a0497, pp. 360\u2013371. Springer, Heidelberg (1991)"},{"issue":"2","key":"50_CR17","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1145\/62044.62050","volume":"36","author":"M.O. Rabin","year":"1989","unstructured":"Rabin, M.O.: Efficient dispersal of information for security, load balancing, and fault tolerance. JACM\u00a036(2), 335\u2013348 (1989)","journal-title":"JACM"},{"issue":"7","key":"50_CR18","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/2465.2467","volume":"28","author":"C.L. Seitz","year":"1985","unstructured":"Seitz, C.L.: The cosmic cube. CACM\u00a028(7), 22\u201333 (1985)","journal-title":"CACM"},{"issue":"3","key":"50_CR19","first-page":"610","volume":"86","author":"Y. Suzuki","year":"2003","unstructured":"Suzuki, Y., Kaneko, K.: An algorithm for node-disjoint paths in pancake graphs. IEICE Trans. Information and Systems\u00a0E86-D(3), 610\u2013615 (2003)","journal-title":"IEICE Trans. Information and Systems"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Processing and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11576235_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:43:52Z","timestamp":1619505832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11576235_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540297697","9783540321002"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11576235_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}