Recognition of Hypercube Embeddable Metrics
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.
KeywordsPolynomial 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.
© Springer-Verlag Berlin Heidelberg 1997