Skip to main content
SpringerLink
Log in

Disjoint paths in the hypercube

  • Distribution And Graphs
  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 411))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L.G. Valiant, "A Scheme for Fast Parallel Communication", SIAM J. Comput., May 1982, pp 350–361.

    Google Scholar 

  2. V.E. Benes, "Mathematical Theory of Connecting Networks and Telephone Traffic", Academic Press, New York 1965.

    Google Scholar 

  3. Michael R. Garey & David S. Johnson, "Computers and Intractability", W.H. Freeman and Company.

    Google Scholar 

  4. R.M. Karp, "On the Computational Complexity of Combinatorial Problems", Networks, 5: pp 45–68.

    Google Scholar 

  5. Y. Shiloach, "The Two Paths Problem is Polynomial", Technical Report, Stanford University, STAN-CS-78-654.

    Google Scholar 

  6. Mark E. Watkins, "On the Existence of Certain Disjoint Arcs in Graphs", Duke Math. Journal, 1968.

    Google Scholar 

  7. H. Whitney, "Congruent Graphs and the Connectivity of Graphs", Amer. J. Math. 54 (1932), 150–168.

    Google Scholar 

  8. E.W. Dijkstra, "A note on two Problems in connection with Graphs", Numerische Mathematik, 1 (1959) pp 269–271.

    Article  Google Scholar 

  9. Youcef Saad and Martin H. Schultz, "Topological Properties of Hypercubes", Research report, YALE/DCS/RR-389.

    Google Scholar 

  10. N. Robertson and P. Seymour, "Graph Minors XIII. The Disjoint Paths Problem", 1986 Manuscript.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Program, University of Texas at Dallas, 75083-0688, Richardson, Texas

    Seshu Madhavapeddy & I. Hal Sudborough

Authors
  1. Seshu Madhavapeddy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. Hal Sudborough
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Manfred Nagl

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Madhavapeddy, S., Sudborough, I.H. (1990). Disjoint paths in the hypercube. In: Nagl, M. (eds) Graph-Theoretic Concepts in Computer Science. WG 1989. Lecture Notes in Computer Science, vol 411. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52292-1_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-52292-1_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52292-8

  • Online ISBN: 978-3-540-46950-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation