{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:16Z","timestamp":1759638856226},"reference-count":9,"publisher":"Informa UK Limited","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1080\/00207160802566805","type":"journal-article","created":{"date-parts":[[2009,7,22]],"date-time":"2009-07-22T19:24:48Z","timestamp":1248290688000},"page":"1692-1708","source":"Crossref","is-referenced-by-count":6,"title":["Disjoint paths in hypercubes with prescribed origins and lengths"],"prefix":"10.1080","volume":"87","author":[{"given":"S. A.","family":"Choudum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Lavanya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Sunitha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.12.050"},{"key":"CIT0002","author":"Choudum S. A.","year":"2006","journal-title":"Spanning caterpillars of hypercubes"},{"key":"CIT0003","doi-asserted-by":"crossref","unstructured":"Dvo\u0159\u00e1k, T., Gregor, P. and Koubek, V. Spanning paths in hypercubes. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb \u201905), DMTCS Proceedings. Edited by: Felsner, S. pp.363\u2013368. Discrete Mathematics and Theoretical Computer Science.","DOI":"10.46298\/dmtcs.3442"},{"key":"CIT0004","unstructured":"Gonzalez, T. F. and Serena, D. Complexity of k-pairwise disjoint shortest paths in the undirected hyprecubic network and related problems. Proceedings of the International Conference on Parallel and Distributed Computing and Systems, PDCS. Canada. IASTED, Acta Press."},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2004.07.006"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2000.1632"},{"key":"CIT0007","doi-asserted-by":"crossref","first-page":"135","DOI":"10.21136\/CPM.1984.108506","volume":"109","author":"Havel I.","year":"1984","journal-title":"[Cbreve]asopis pro P\u0115stov\u00e1n\u00ed Matematiky"},{"key":"CIT0008","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"Leighton F. T.","year":"1992"},{"key":"CIT0009","doi-asserted-by":"crossref","first-page":"705","DOI":"10.21136\/CMJ.1988.102266","volume":"38","author":"Nebesk\u00fd L.","year":"1988","journal-title":"Czech. Math. J"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207160802566805","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,9]],"date-time":"2021-10-09T00:04:48Z","timestamp":1633737888000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207160802566805"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7]]},"references-count":9,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["10.1080\/00207160802566805"],"URL":"https:\/\/doi.org\/10.1080\/00207160802566805","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7]]}}}