{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T22:21:16Z","timestamp":1767046876038},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,9,19]],"date-time":"2013-09-19T00:00:00Z","timestamp":1379548800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s11227-013-1013-9","type":"journal-article","created":{"date-parts":[[2013,9,18]],"date-time":"2013-09-18T11:14:23Z","timestamp":1379502863000},"page":"485-495","source":"Crossref","is-referenced-by-count":9,"title":["k-pairwise disjoint paths routing in perfect hierarchical hypercubes"],"prefix":"10.1007","volume":"67","author":[{"given":"Antoine","family":"Bossard","sequence":"first","affiliation":[]},{"given":"Keiichi","family":"Kaneko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,9,19]]},"reference":[{"key":"1013_CR1","unstructured":"TOP500 (2011) Japan\u2019s K computer tops 10 petaflop\/s to stay atop TOP500 List. http:\/\/www.top500.org\/lists\/2011\/11\/ , November 2011. Last accessed December 2012"},{"key":"1013_CR2","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1109\/CMPCON.1997.584688","volume-title":"Proc IEEE compcon \u201997","author":"J Laudon","year":"1997","unstructured":"Laudon J, Lenoski D (1997) System overview of the SGI origin 200\/2000 product line. In: Proc IEEE compcon \u201997, San Jose, CA, USA, pp 150\u2013156"},{"issue":"10","key":"1013_CR3","doi-asserted-by":"crossref","first-page":"1294","DOI":"10.1016\/j.jpdc.2006.03.008","volume":"66","author":"X Yang","year":"2006","unstructured":"Yang X, Megson GM, Evans DJ (2006) An oblivious shortest-path routing algorithm for fully connected cubic networks. J Parallel Distrib Comput 66(10):1294\u20131303","journal-title":"J Parallel Distrib Comput"},{"issue":"31\u201333","key":"1013_CR4","doi-asserted-by":"crossref","first-page":"2912","DOI":"10.1016\/j.tcs.2010.04.022","volume":"411","author":"P-L Lai","year":"2010","unstructured":"Lai P-L, Hsu H-C, Tsai C-H, Stewart IA (2010) A class of hierarchical graphs as topologies for interconnection networks. Theor Comput Sci 411(31\u201333):2912\u20132924","journal-title":"Theor Comput Sci"},{"issue":"6","key":"1013_CR5","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/S0020-0190(98)00121-5","volume":"67","author":"Q-P Gu","year":"1998","unstructured":"Gu Q-P, Peng S (1998) An efficient algorithm for k-pairwise disjoint paths in star graphs. Inf Process Lett 67(6):283\u2013287","journal-title":"Inf Process Lett"},{"issue":"4","key":"1013_CR6","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1109\/12.21148","volume":"38","author":"SB Akers","year":"1989","unstructured":"Akers SB, Krishnamurthy B (1989) A group theoretic model for symmetric interconnection networks. IEEE Trans Comput 38(4):555\u2013566","journal-title":"IEEE Trans Comput"},{"issue":"7","key":"1013_CR7","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1109\/71.395400","volume":"6","author":"D-R Duh","year":"1995","unstructured":"Duh D-R, Chen G-H, Fang J-F (1995) Algorithms and properties of a new two-level network with folded hypercubes as basic modules. IEEE Trans Parallel Distrib Syst 6(7):714\u2013723","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"1","key":"1013_CR8","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/71.262585","volume":"5","author":"QM Malluhi","year":"1994","unstructured":"Malluhi QM, Bayoumi MA (1994) The hierarchical hypercube: a new interconnection topology for massively parallel systems. IEEE Trans Parallel Distrib Syst 5(1):17\u201330","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"2","key":"1013_CR9","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1006\/jmca.1994.1009","volume":"17","author":"J Wu","year":"1994","unstructured":"Wu J, Sun X-H (1994) Optimal cube-connected cube multicomputers. J Microcomput Appl 17(2):135\u2013146","journal-title":"J Microcomput Appl"},{"key":"1013_CR10","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1145\/76263.76310","volume-title":"Proc 1989 ACM\/IEEE conf on supercomputing","author":"K Ghose","year":"1989","unstructured":"Ghose K, Desai KR (1989) The HCN: a versatile interconnection network based on cubes. In: Proc 1989 ACM\/IEEE conf on supercomputing, Reno, Nevada, USA, pp 426\u2013435"},{"key":"1013_CR11","first-page":"758","volume":"49","author":"NG Bruijn De","year":"1946","unstructured":"De Bruijn NG (1946) A combinatorial problem. Proc K Ned Akad Wet 49:758\u2013764","journal-title":"Proc K Ned Akad Wet"},{"issue":"19","key":"1013_CR12","doi-asserted-by":"crossref","first-page":"4200","DOI":"10.1016\/j.ins.2007.02.035","volume":"177","author":"R-Y Wu","year":"2007","unstructured":"Wu R-Y, Chen G-H, Kuo Y-L, Chang GJ (2007) Node-disjoint paths in hierarchical hypercube networks. Inf Sci 177(19):4200\u20134207","journal-title":"Inf Sci"},{"issue":"8","key":"1013_CR13","doi-asserted-by":"crossref","first-page":"1372","DOI":"10.1093\/comjnl\/bxr047","volume":"54","author":"A Bossard","year":"2011","unstructured":"Bossard A, Kaneko K, Peng S (2011) A new node-to-set disjoint-path algorithm in perfect hierarchical hypercubes. Comput J 54(8):1372\u20131381","journal-title":"Comput J"},{"issue":"6","key":"1013_CR14","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1093\/comjnl\/bxr135","volume":"55","author":"A Bossard","year":"2012","unstructured":"Bossard A, Kaneko K (2012) The set-to-set disjoint-path problem in perfect hierarchical hypercubes. Comput J 55(6):769\u2013775","journal-title":"Comput J"},{"key":"1013_CR15","unstructured":"Shiloach Y (1978) The two paths problem is polynomial. Technical Report CS-TR-78-654, Stanford University"},{"key":"1013_CR16","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","volume":"5","author":"RM Karp","year":"1975","unstructured":"Karp RM (1975) On the computational complexity of combinational problems. Networks 5:45\u201368","journal-title":"Networks"},{"issue":"9","key":"1013_CR17","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1109\/12.620486","volume":"46","author":"Q-P Gu","year":"1997","unstructured":"Gu Q-P, Peng S (1997) k-pairwise cluster fault tolerant routing in hypercubes. IEEE Trans Comput 46(9):1042\u20131049","journal-title":"IEEE Trans Comput"},{"issue":"1","key":"1013_CR18","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/2465.2467","volume":"28","author":"CL Seitz","year":"1985","unstructured":"Seitz CL (1985) The cosmic cube. Commun ACM 28(1):22\u201333","journal-title":"Commun ACM"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-013-1013-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-013-1013-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-013-1013-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,24]],"date-time":"2019-07-24T05:25:00Z","timestamp":1563945900000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-013-1013-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,19]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["1013"],"URL":"https:\/\/doi.org\/10.1007\/s11227-013-1013-9","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,19]]}}}