{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:00Z","timestamp":1725663660015},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540522928"},{"type":"electronic","value":"9783540469506"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52292-1_1","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:29:13Z","timestamp":1330205353000},"page":"3-18","source":"Crossref","is-referenced-by-count":5,"title":["Disjoint paths in the hypercube"],"prefix":"10.1007","author":[{"given":"Seshu","family":"Madhavapeddy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I. Hal","family":"Sudborough","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"L.G. Valiant, \"A Scheme for Fast Parallel Communication\", SIAM J. Comput., May 1982, pp 350\u2013361.","DOI":"10.1137\/0211027"},{"key":"1_CR2","volume-title":"Mathematical Theory of Connecting Networks and Telephone Traffic","author":"V.E. Benes","year":"1965","unstructured":"V.E. Benes, \"Mathematical Theory of Connecting Networks and Telephone Traffic\", Academic Press, New York 1965."},{"key":"1_CR3","unstructured":"Michael R. Garey & David S. Johnson, \"Computers and Intractability\", W.H. Freeman and Company."},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"R.M. Karp, \"On the Computational Complexity of Combinatorial Problems\", Networks, 5: pp 45\u201368.","DOI":"10.1002\/net.1975.5.1.45"},{"key":"1_CR5","unstructured":"Y. Shiloach, \"The Two Paths Problem is Polynomial\", Technical Report, Stanford University, STAN-CS-78-654."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Mark E. Watkins, \"On the Existence of Certain Disjoint Arcs in Graphs\", Duke Math. Journal, 1968.","DOI":"10.1215\/S0012-7094-68-03523-0"},{"key":"1_CR7","doi-asserted-by":"crossref","first-page":"150","DOI":"10.2307\/2371086","volume":"54","author":"H. Whitney","year":"1932","unstructured":"H. Whitney, \"Congruent Graphs and the Connectivity of Graphs\", Amer. J. Math. 54 (1932), 150\u2013168.","journal-title":"Amer. J. Math."},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"E.W. Dijkstra, \"A note on two Problems in connection with Graphs\", Numerische Mathematik, 1 (1959) pp 269\u2013271.","journal-title":"Numerische Mathematik"},{"key":"1_CR9","unstructured":"Youcef Saad and Martin H. Schultz, \"Topological Properties of Hypercubes\", Research report, YALE\/DCS\/RR-389."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"N. Robertson and P. Seymour, \"Graph Minors XIII. The Disjoint Paths Problem\", 1986 Manuscript.","DOI":"10.1016\/0095-8956(86)90031-6"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52292-1_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:23:47Z","timestamp":1605648227000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52292-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540522928","9783540469506"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-52292-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}