{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:03:14Z","timestamp":1743145394790,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131189"},{"type":"electronic","value":"9783642131196"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13119-6_44","type":"book-chapter","created":{"date-parts":[[2010,5,26]],"date-time":"2010-05-26T00:35:39Z","timestamp":1274834139000},"page":"511-519","source":"Crossref","is-referenced-by-count":4,"title":["Fault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes"],"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"}]},{"given":"Shietung","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"44_CR1","unstructured":"White, A., Grice, D. (IBM): Roadrunner: Science, Cell and a Petaflop\/s. In: International Supercomputing Conference (2008)"},{"key":"44_CR2","unstructured":"EE Times: U.S. taps IBM for 20 petaflops computer (2009), \n                      http:\/\/eetimes.com\/news\/design\/showArticle.jhtml?articleID=213000489"},{"key":"44_CR3","unstructured":"Vanvoorst, B., Seidel, S., Barscz, E.: Workload of an ipsc\/860. In: Proc. Scalable High-Performance Computing Conf., pp. 221\u2013228 (1994)"},{"key":"44_CR4","unstructured":"SGI: Origin2000 Rackmount Owner\u2019s Guide, 007-3456-003 (1997), \n                      http:\/\/techpubs.sgi.com\/"},{"issue":"7","key":"44_CR5","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 Transactions on Computers\u00a037(7), 867\u2013872 (1988)","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"44_CR6","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1093\/comjnl\/39.1.14","volume":"39","author":"Q. Gu","year":"1996","unstructured":"Gu, Q., Peng, S.: An Efficient Algorithm for Node-to-node Routing in Hypercubes with Faulty Clusters. The Computer Journal\u00a039(1), 14\u201319 (1996)","journal-title":"The Computer Journal"},{"issue":"2","key":"44_CR7","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1145\/62044.62050","volume":"36","author":"M.A. Rabin","year":"1989","unstructured":"Rabin, M.A.: Efficient dispersal of information for security. Journal of ACM\u00a036(2), 335\u2013348 (1989)","journal-title":"Journal of ACM"},{"issue":"12","key":"44_CR8","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":"6","key":"44_CR9","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0020-0190(93)90043-9","volume":"45","author":"L. Gargano","year":"1993","unstructured":"Gargano, L., Vaccaro, U., Vozella, A.: Fault tolerant routing in the star and pancake interconnection networks. Inf. Processing Letters\u00a045(6), 315\u2013320 (1993)","journal-title":"Inf. Processing Letters"},{"issue":"8","key":"44_CR10","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/S0167-8191(98)00050-7","volume":"24","author":"Q. Gu","year":"1998","unstructured":"Gu, Q., Peng, S.: Node-to-set and Set-to-set Cluster Fault Tolerant Routing in Hypercubes. Parallel Computing\u00a024(8), 1245\u20131261 (1998)","journal-title":"Parallel Computing"},{"key":"44_CR11","unstructured":"Latifi, S., Ko, H., Srimani, P.: Node-to-set Vertex Disjoint Paths in Hypercube Networks. Technical Report CS-98-107"},{"key":"44_CR12","doi-asserted-by":"crossref","unstructured":"Bossard, A., Kaneko, K., Peng, S.: Node-to-set Disjoint-path Routing Metacube. In: Proceedings of the 10th International Conference on Parallel and Distributed Computing, Applications and Technologies (2009)","DOI":"10.1109\/I-SPAN.2009.66"},{"key":"44_CR13","doi-asserted-by":"crossref","unstructured":"Bossard, A., Kaneko, K., Peng, S.: A Node-to-set Disjoint-path Routing Algorithm in Metacube. In: Proceedings of the 10th International Symposium on Pervasive Systems, Algorithms and Networks (2009)","DOI":"10.1109\/I-SPAN.2009.66"},{"key":"44_CR14","doi-asserted-by":"crossref","unstructured":"Bossard, A., Kaneko, K., Peng, S.: Node-to-set Disjoint Paths Problem in Perfect Hierarchical Hypercubes. In: Proceedings of the 9th Parallel and Distributed Computing and Networks (2010)","DOI":"10.2316\/P.2010.676-078"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13119-6_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T21:33:00Z","timestamp":1674077580000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-13119-6_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131189","9783642131196"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13119-6_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}