{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T22:23:52Z","timestamp":1767047032691,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,5,16]],"date-time":"2011-05-16T00:00:00Z","timestamp":1305504000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["22500041"],"award-info":[{"award-number":["22500041"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,5,16]]},"DOI":"10.1145\/1992896.1992903","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T11:53:52Z","timestamp":1307361232000},"page":"51-57","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Set-to-set disjoint-path routing in perfect hierarchical hypercubes"],"prefix":"10.1145","author":[{"given":"Antoine","family":"Bossard","sequence":"first","affiliation":[{"name":"Tokyo University of Agriculture and Technology, Koganei-shi, Tokyo, Japan"}]},{"given":"Keiichi","family":"Kaneko","sequence":"additional","affiliation":[{"name":"Tokyo University of Agriculture and Technology, Koganei-shi, Tokyo, Japan"}]}],"member":"320","published-online":{"date-parts":[[2011,5,16]]},"reference":[{"volume-title":"Proceedings of the Cray User Group Conference","year":"2009","author":"Bland Arthur S.","key":"e_1_3_2_1_1_1"},{"volume-title":"Proceedings of the 11th International Conference on Computational Science","year":"2011","author":"Bossard Antoine","key":"e_1_3_2_1_2_1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(91)90131-R"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/76263.76310"},{"key":"e_1_3_2_1_5_1","unstructured":"Qian-Ping Gu Satoshi Okawa and Shietung Peng. Set-to-set fault tolerant routing in hypercubes. IEICE Transactions on Fundamentals E79-A(4):483--488 1996.  Qian-Ping Gu Satoshi Okawa and Shietung Peng. Set-to-set fault tolerant routing in hypercubes. IEICE Transactions on Fundamentals E79-A(4):483--488 1996."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/39.1.14"},{"key":"e_1_3_2_1_7_1","unstructured":"Qian-Ping Gu and Shietung Peng. Set-to-set fault tolerant routing in star graphs. IEICE Transactions on Information and Systems E79-D(4):282--289 1996.  Qian-Ping Gu and Shietung Peng. Set-to-set fault tolerant routing in star graphs. IEICE Transactions on Information and Systems E79-D(4):282--289 1996."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/PDCAT.2006.56"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-009-0297-2"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.262585"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1006\/jmca.1994.1009"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.02.035"}],"event":{"name":"C3S2E '11: Fourth International C* Conference on Computer Science & Software Engineering","sponsor":["ACM Association for Computing Machinery","BytePress","Concordia University Concordia University"],"location":"Montreal Quebec Canada","acronym":"C3S2E '11"},"container-title":["Proceedings of The Fourth International C* Conference on Computer Science and Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1992896.1992903","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1992896.1992903","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:26:39Z","timestamp":1750278399000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1992896.1992903"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,16]]},"references-count":12,"alternative-id":["10.1145\/1992896.1992903","10.1145\/1992896"],"URL":"https:\/\/doi.org\/10.1145\/1992896.1992903","relation":{},"subject":[],"published":{"date-parts":[[2011,5,16]]},"assertion":[{"value":"2011-05-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}