Recognition of Hypercube Embeddable Metrics

  • Michel Marie Deza
  • Monique Laurent
Part of the Algorithms and Combinatorics book series (AC, volume 15)


In this chapter we consider the following problem, called the hypercube embeddability problem:

Given a distance d on Vn, test whether d is hypercube embeddable.


Polynomial Time Intersection Pattern Complete Bipartite Graph Extremal Graph Maximal Transversal 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Michel Marie Deza
    • 1
    • 2
  • Monique Laurent
    • 1
    • 3
  1. 1.Département de Mathématiques et d’InformatiqueLaboratoire d’Informatique de l’Ecole Normale SupérieureParis Cedex 05France
  2. 2.Department of MathematicsMoscow Pedagogical State UniversityMoscowRussia
  3. 3.CWIAmsterdamThe Netherlands

Personalised recommendations