{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T02:10:03Z","timestamp":1748657403752,"version":"3.41.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319235080"},{"type":"electronic","value":"9783319235097"}],"license":[{"start":{"date-parts":[[2015,10,15]],"date-time":"2015-10-15T00:00:00Z","timestamp":1444867200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,10,15]],"date-time":"2015-10-15T00:00:00Z","timestamp":1444867200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-23509-7_6","type":"book-chapter","created":{"date-parts":[[2015,10,15]],"date-time":"2015-10-15T10:03:34Z","timestamp":1444903414000},"page":"77-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Solving the Container Problem in a Hypercube with Bit Constraint"],"prefix":"10.1007","author":[{"given":"Antoine","family":"Bossard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keiichi","family":"Kaneko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,15]]},"reference":[{"issue":"7","key":"6_CR1","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1109\/12.2234","volume":"37","author":"Y Saad","year":"1988","unstructured":"Saad, Y., Schultz, M.H.: Topological properties of hypercubes. IEEE Trans. Comput. 37(7), 867-872 (1988)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/2465.2467","volume":"28","author":"CL Seitz","year":"1985","unstructured":"Seitz, C.L.: The cosmic cube. Commun. ACM 28(1), 22-33 (1985)","journal-title":"Commun. ACM"},{"key":"6_CR3","unstructured":"TOP500. List. http:\/\/top500.org\/list\/2014\/06\/, June 2014. Last accessed July 2014"},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1023\/B:SUPE.0000014803.83151.dc","volume":"28","author":"Y Li","year":"2004","unstructured":"Li, Y., Peng, S., Chu, W.: Efficient collective communications in dual-cube. J. Supercomput. 28(1), 71-90 (2004)","journal-title":"J. Supercomput."},{"issue":"2","key":"6_CR5","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s11227-009-0297-2","volume":"53","author":"Y Li","year":"2010","unstructured":"Li, Y., Peng, S., Chu, W.: Metacube - a versatile family of interconnection networks for extremely large-scale supercomputers. J. Supercomput. 53(2), 329-351 (2010)","journal-title":"J. Supercomput."},{"issue":"1","key":"6_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/71.262585","volume":"5","author":"QM Malluhi","year":"1994","unstructured":"Malluhi, Q.M., Bayoumi, M.A.: The hierarchical hypercube: a new interconnection topology for massively parallel systems. IEEE Trans. Parallel Distrib. Syst. 5(1), 17-30 (1994)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Ghose, K., Desai, K.R.:The HCN: a versatile interconnection network based on cubes. In: Proceedings of the 1989 ACM\/IEEE Conference on Supercomputing, pp. 426-435. Reno, NV, USA, November 12-17 (1989)","DOI":"10.1145\/76263.76310"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1006\/jctb.1998.1850","volume":"74","author":"S Gao","year":"1998","unstructured":"Gao, S., Novick, B., Qiu, K.: From Hall\u2019s matching theorem to optimal routing on hypercubes. J. Comb. Theory Ser. B 74, 291-301 (1998)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"7","key":"6_CR9","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1109\/TC.2010.76","volume":"59","author":"O Sinanoglu","year":"2010","unstructured":"Sinanoglu, O., Karaata, M.H., AlBdaiwi, B.: An inherently stabilizing algorithm for node-to-node routing over all shortest node-disjoint paths in hypercube networks. IEEE Trans. Comput. 59(7), 995-999 (2010)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"6_CR10","first-page":"1087","volume":"30","author":"A Bossard","year":"2014","unstructured":"Bossard, A., Kaneko, K.: Time optimal node-to-set disjoint paths routing in hypercubes. J. Inf. Sci. Eng. 30(4), 1087-1093 (2014)","journal-title":"J. Inf. Sci. Eng."},{"key":"6_CR11","unstructured":"Gu Q.-P., Okawa S., Peng S.: Set-to-set fault tolerant routing in hypercubes. IEICE Trans. Fundam. E79-A(4):483-488 (1996)"},{"issue":"6","key":"6_CR12","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1006\/jpdc.2000.1632","volume":"60","author":"Q-P Gu","year":"2000","unstructured":"Gu, Q.-P., Peng, S.: An efficient algorithm for the $k$-pairwise disjoint paths problem in hypercubes. J. Parallel Distrib. Comput. 60(6), 764-774 (2000)","journal-title":"J. Parallel Distrib. Comput."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Bossard, A., Kaneko, K.: On hypercube routing and fault tolerance with bit constraint. In: Proceedings of the Second International Symposium on Computing and Networking, pp. 40-49. Shizuoka City, Japan, December 10-12 (2014)","DOI":"10.1109\/CANDAR.2014.46"},{"key":"6_CR14","unstructured":"Li, Y., Peng, S., Chu, W.: Disjoint paths in metacube. In: Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems, pp. 43-50. Marina del Rey, CA, USA, November 3-5 (2003)"},{"issue":"1","key":"6_CR15","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/MITP.2008.10","volume":"10","author":"S Murugesan","year":"2008","unstructured":"Murugesan, S.: Harnessing Green IT: principles and practices. IT Prof. 10(1), 24-33 (2008)","journal-title":"IT Prof."},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1142\/S0219265905001290","volume":"6","author":"J Chen","year":"2005","unstructured":"Chen, J., Kanj, I.A., Wang, G.: Hypercube network fault tolerance: a probabilistic approach. J. Interconnect. Netw. 6(1), 17-34 (2005)","journal-title":"J. Interconnect. Netw."},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Dietzfelbinger, M., Madhavapeddy, S., Sudborough, I.H.: Three disjoint path paradigms in star networks. In: Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, pp. 400-406. Dallas, TX, USA, December 2-5 (1991)","DOI":"10.1109\/SPDP.1991.218213"},{"key":"6_CR18","unstructured":"Suzuki, Y., Kaneko, K.: An algorithm for node-disjoint paths in pancake graphs. IEICE Trans. Inf. Syst. E86-D(3):610-615 (2003)"},{"issue":"1","key":"6_CR19","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1093\/ietisy\/e90-1.1.306","volume":"E90-D","author":"K. KANEKO","year":"2007","unstructured":"Kaneko, K., Sawada, N.: An algorithm for node-to-node disjoint paths problem in burnt pancake graphs. IEICE Trans. Inf. Syst. E90-D(1):306-313 (2007)","journal-title":"IEICE Transactions on Information and Systems"},{"key":"6_CR20","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","volume":"10","author":"K Menger","year":"1927","unstructured":"Menger, K.: Zur allgemeinen Kurventheorie. Fundamenta Mathematicae 10, 96-115 (1927)","journal-title":"Zur allgemeinen Kurventheorie. Fundamenta Mathematicae"},{"issue":"2","key":"6_CR21","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1017\/S0956796801004208","volume":"12","author":"RB Findler","year":"2002","unstructured":"Findler, R.B., Clements, J., Flanagan, C., Flatt, M., Krishnamurthi, S., Steckler, P., Felleisen, M.: DrScheme: a programming environment for scheme. J. Funct. Prog. 12(2), 159-182 (2002)","journal-title":"J. Funct. Prog."}],"container-title":["Studies in Computational Intelligence","Software Engineering, Artificial Intelligence, Networking and Parallel\/Distributed Computing 2015"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23509-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T01:30:50Z","timestamp":1748655050000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23509-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,15]]},"ISBN":["9783319235080","9783319235097"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23509-7_6","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2015,10,15]]},"assertion":[{"value":"15 October 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}