{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:19:07Z","timestamp":1743049147328,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_64","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"742-753","source":"Crossref","is-referenced-by-count":3,"title":["Many-to-Many Disjoint Path Covers in a Graph with Faulty Elements"],"prefix":"10.1007","author":[{"given":"Jung-Heum","family":"Park","sequence":"first","affiliation":[]},{"given":"Hee-Chul","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Hyeong-Seok","family":"Lim","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"64_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications, 5th printing","author":"J.A. Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications, 5th printing. American Elsevier Publishing Co, Amsterdam (1976)"},{"issue":"12","key":"64_CR2","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 Transactions on Parallel and Distributed Systems\u00a08(12), 1196\u20131202 (1997)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"64_CR3","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, Series B\u00a074, 291\u2013301 (1998)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"1","key":"64_CR4","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/(SICI)1097-0037(200001)35:1<83::AID-NET7>3.0.CO;2-D","volume":"35","author":"Q.P. Gu","year":"2000","unstructured":"Gu, Q.P., Peng, S.: Cluster fault-tolerant routing in star graphs. Networks\u00a035(1), 83\u201390 (2000)","journal-title":"Networks"},{"key":"64_CR5","unstructured":"Huang, W.T., Lin, M.Y., Tan, J.M., Hsu, L.H.: Fault-tolerant ring embedding in faulty crossed cubes. In: Proc. SCI 2000, pp. 97\u2013102 (2000)"},{"key":"64_CR6","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1006\/jpdc.2001.1813","volume":"62","author":"W.T. Huang","year":"2002","unstructured":"Huang, W.T., Tan, J.M., Huang, C.N., Hsu, L.H.: Fault-tolerant hamiltonicity of twisted cubes. J. Parallel Distrib. Comput.\u00a062, 591\u2013604 (2002)","journal-title":"J. Parallel Distrib. Comput."},{"key":"64_CR7","doi-asserted-by":"crossref","unstructured":"Madhavapeddy, S., Sudborough, I.H.: A topological property of hypercubes: node disjoint paths. In: Proc. of the 2th IEEE Symposium on Parallel and Distributed Processing, pp. 532\u2013539 (1990)","DOI":"10.1109\/SPDP.1990.143599"},{"issue":"12","key":"64_CR8","first-page":"691","volume":"30","author":"J.-H. Park","year":"2003","unstructured":"Park, J.-H.: One-to-one disjoint path covers in recursive circulants. Journal of KISS\u00a030(12), 691\u2013698 (2003)(in Korean)","journal-title":"Journal of KISS"},{"key":"64_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-540-27798-9_42","volume-title":"Computing and Combinatorics","author":"J.-H. Park","year":"2004","unstructured":"Park, J.-H.: One-to-many disjoint path covers in a graph with faulty elements. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol.\u00a03106, pp. 392\u2013401. Springer, Heidelberg (2004)"},{"key":"64_CR10","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0304-3975(00)00176-6","volume":"244","author":"J.-H. Park","year":"2000","unstructured":"Park, J.-H., Chwa, K.Y.: Recursive circulants and their embeddings among hypercubes. Theoretical Computer Science\u00a0244, 35\u201362 (2000)","journal-title":"Theoretical Computer Science"},{"key":"64_CR11","unstructured":"Tsai, C.-H., Tan, J.J.M., Chuang, Y.-C., Hsu, L.-H.: Fault-free cycles and links in faulty recursive circulant graphs. In: Proc. of Workshop on Algorithms and Theory of Computation ICS2000, pp. 74\u201377 (2000)"},{"issue":"6","key":"64_CR12","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.ipl.2004.05.013","volume":"91","author":"C.-H. Tsai","year":"2004","unstructured":"Tsai, C.-H., Tan, J.J.M., Hsu, L.-H.: The super-connected property of recursive circulant graphs. Inform. Proc. Lett., 91(6), 293\u2013298 (2004)","journal-title":"Inform. Proc. Lett."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T21:52:31Z","timestamp":1740261151000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}