Embeddings in hypercubes
暂无分享，去创建一个
[1] E. Gilbert. Gray codes and paths on the N-cube , 1958 .
[2] V. Firsov. Isometric embedding of a graph in a Boolean cube , 1965 .
[3] Ronald L. Graham,et al. ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS , 1970 .
[4] I. Havel,et al. $B$-valuations of graphs , 1972 .
[5] Ivan Havel,et al. Embedding the polytomic tree into the $n$-cube , 1973 .
[6] L. Nebeský. On cubes and dichotomic trees , 1974 .
[7] Michael Randolph Garey,et al. On cubical graphs , 1975 .
[8] Ivan Havel. Embedding graphs in undirected and directed cubes , 1983 .
[9] George Papageorgiou,et al. The Complexity of Cubical Graphs , 1985, Inf. Control..
[10] Ilse C. F. Ipsen,et al. How to Embed Trees in Hypercubes. , 1985 .
[11] John P. Hayes,et al. A Microprocessor-based Hypercube Supercomputer , 1986, IEEE Micro.
[12] Arnold L. Rosenberg,et al. Optimal simulations of tree machines , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[13] Quentin F. Stout,et al. Passing messages in link-bound hypercubes , 1986 .
[14] S. Lennart Johnsson,et al. On the Embedding of Arbitrary Meshes in Boolean Cubes With Expansion Two Dilation Two , 1987, ICPP.
[15] F. Harary,et al. A survey of the theory of hypercube graphs , 1988 .