Skip to main content
SpringerLink
Log in

On the complexity of isometric embedding in the hypercube

  • Conference paper
  • First Online:
Algorithms (SIGAL 1990)

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

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. P. Assouad and M. Deza, “Espaces Metriques Plongeables dans un Hypercube: Aspects Combinatoires,” Annals of Discrete Math., vol. 8, pp. 197–210, 1980.

    Google Scholar 

  2. D. Avis and M. Deza, “L 1-Embedability, Complexity and Multicommodity Flows,” Research Memorandum RMI 88-11, Dept. of Math. Engineering and Instrumentation Physics, University of Tokyo, September 1988.

    Google Scholar 

  3. V. Chvatal, “Recognizing Intersection Patterns,” Annals of Discrete Maths., vol. 8, 1980.

    Google Scholar 

  4. M. Deza(Tylkin), “On Hamming Geometry of Unit Cubes,” Doklady Akad. Nauk. SSR., vol. 134, pp. 1037–1040, 1960. English translation in Soviet Physics Dokl. 5 (1961), 940–943.

    Google Scholar 

  5. M. Deza, “Matrices de formes quadratiques non negatives pour des arguments binaires,” C.R. Acad. Sc. Paris, vol. 277, pp. 873–875, 1973.

    Google Scholar 

  6. M. Deza and N.M. Singhi, “On Rigid Pentagons in Hypercubes,” Graphs and Combinatorics, vol. 4, pp. 31–42, 1988.

    Article  Google Scholar 

  7. D.Z Djokovic, “Distance Preserving Subgraphs of Hypercubes,” J. Comb. Theory B, vol. 14, pp. 263–267, 1973.

    Article  Google Scholar 

  8. M.R. Garey and R.L. Graham, “On Cubical Graphs,” J. Comb.Theory B, vol. 18, pp. 84–95, 1975.

    Article  Google Scholar 

  9. I. Hoyler, “The NP-Completeness of Some Edge-Partition Problems,” SIAM J. Computing, vol. 10, pp. 713–717, 1981.

    Article  Google Scholar 

  10. D. W. Krumme, K. N. Venkataraman, and G. Cybenko, “Hypercube Embedding is NP-Complete,” in Hypercube Multiprocessors 1986, pp. 148–157, SIAM, 1986.

    Google Scholar 

  11. A. Wagner and D.G. Corneil, “Embedding Trees in a Hypercube is NP-complete,” in TR 197/87, University of Toronto, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, McGill University, 3480 University, H3A 2A7, Montreal, Quebec

    David Avis

Authors
  1. David Avis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tetsuo Asano Toshihide Ibaraki Hiroshi Imai Takao Nishizeki

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Avis, D. (1990). On the complexity of isometric embedding in the hypercube. In: Asano, T., Ibaraki, T., Imai, H., Nishizeki, T. (eds) Algorithms. SIGAL 1990. Lecture Notes in Computer Science, vol 450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52921-7_84

Download citation

  • DOI: https://doi.org/10.1007/3-540-52921-7_84

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52921-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation