{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:46:11Z","timestamp":1743032771175,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020254"},{"type":"electronic","value":"9783642020261"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02026-1_35","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T16:31:23Z","timestamp":1245256283000},"page":"375-383","source":"Crossref","is-referenced-by-count":5,"title":["On Disjoint Shortest Paths Routing on the Hypercube"],"prefix":"10.1007","author":[{"given":"Eddie","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuhong","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhizhang","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"12","key":"35_CR1","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1109\/71.640011","volume":"8","author":"C.C. Chen","year":"1997","unstructured":"Chen, C.C., Chen, J.: Nearly Optimal One-to-Many Parallel Routing in Star Networks. IEEE trans. on Parallel and Distributed Systems\u00a08(12), 1196\u20131202 (1997)","journal-title":"IEEE trans. on Parallel and Distributed Systems"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1109\/SPDP.1991.218213","volume-title":"Proc. of the 3rd IEEE Symposium on Parallel and Distributed Processing","author":"M. Dietzfelbinger","year":"1991","unstructured":"Dietzfelbinger, M., Madhavapeddy, S., Sudborough, I.H.: Three Disjoint Path Paradigms in Star Networks. In: Proc. of the 3rd IEEE Symposium on Parallel and Distributed Processing, pp. 400\u2013406. IEEE Computer Society Press, Dallas (1991)"},{"issue":"3","key":"35_CR3","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1002\/(SICI)1097-0037(199710)30:3<219::AID-NET6>3.0.CO;2-O","volume":"30","author":"D.R. Duh","year":"1998","unstructured":"Duh, D.R., Chen, G.H.: On the Rabin Number Problem. Networks\u00a030(3), 219\u2013230 (1998)","journal-title":"Networks"},{"issue":"2","key":"35_CR4","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. Journal of Combinatorial Theory (B)\u00a074(2), 291\u2013301 (1998)","journal-title":"Journal of Combinatorial Theory (B)"},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1016\/j.parco.2004.07.006","volume":"30","author":"T.F. Gonzalez","year":"2004","unstructured":"Gonzalez, T.F., Serena, D.: n-Cube Network: Node Disjoint Shortest Paths for Maximal Distance Pairs of Vertices. Parallel Computing\u00a030, 973\u2013998 (2004)","journal-title":"Parallel Computing"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/S0167-8191(98)00050-7","volume":"24","author":"Q.P. Gu","year":"1998","unstructured":"Gu, Q.P., Peng, S.T.: Node-to-Set and Set-to-Set Cluster Fault Tolerant Routing in Hypercubes. Parallel Computing\u00a024, 1245\u20131261 (1998)","journal-title":"Parallel Computing"},{"key":"35_CR7","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.T.: An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes. Journal of Parallel and Distributed Computing\u00a060, 764\u2013774 (2000)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P. Hall","year":"1935","unstructured":"Hall, P.: On Representatives of Subsets. J. London Math. Soc.\u00a010, 26\u201330 (1935)","journal-title":"J. London Math. Soc."},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n\n                  5\/2 Algorithm for Maximum Matching in Bipartite Graphs. J. SIAM Comp.\u00a02, 225\u2013231 (1973)","journal-title":"J. SIAM Comp."},{"key":"35_CR10","unstructured":"Lai, C.N.: One-to-Many Disjoint Paths in the Hypercube and Folded Hypercube. Ph.D. Thesis, National Taiwan University (2001)"},{"key":"35_CR11","unstructured":"Latifi, S., Ko, H., Srimani, P.K.: Node-to-Set Vertex Disjoint Paths in Hypercube Networks. Technical Report CS-98-107, Colorado State University (1998)"},{"key":"35_CR12","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C.H. Papadimitriou","year":"1998","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover, Mineola (1998)"},{"key":"35_CR13","first-page":"105","volume":"119","author":"K. Qiu","year":"1996","unstructured":"Qiu, K., Novick, B.: Disjoint Paths in Hypercubes. Congressus Numerantium\u00a0119, 105\u2013112 (1996)","journal-title":"Congressus Numerantium"},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/ICPADS.2008.119","volume-title":"Proc. 14th IEEE International Conference on Parallel and Distributed Systems (ICPADS 2008)","author":"K. Qiu","year":"2008","unstructured":"Qiu, K.: An Efficient Disjoint Shortest Paths Routing Algorithm for the Hypercube. In: Proc. 14th IEEE International Conference on Parallel and Distributed Systems (ICPADS 2008), pp. 43\u201347. IEEE Computer Society Press, Melbourne (2008)"},{"issue":"2","key":"35_CR15","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. Journal of ACM\u00a036(2), 335\u2013348 (1989)","journal-title":"Journal of ACM"},{"key":"35_CR16","unstructured":"Stewart, I.A., Xiang, Y.H.: One-to-Many Node-Disjoint Paths in (n, k)-Star Graphs. Technical Report, Department of Computer Science, Durham University, UK (2008)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02026-1_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:52:24Z","timestamp":1714621944000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-02026-1_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020254","9783642020261"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02026-1_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}