On the complexity of isometric embedding in the hypercube

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

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

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

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

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

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

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

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

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

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

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