Author:
Pliszka Zbigniew,Unold Olgierd
Publisher
Springer International Publishing
Reference16 articles.
1. Abraham, J., Arockiaraj, M.: Wirelength of enhanced hypercubes into r-Rooted complete binary trees. Electron. Notes Discret. Math. 53, 373–382 (2016)
2. Ammerlaan, J., Vassilev, T.S.: Properties of the binary hypercube and middle level graphs. Appl. Math. 3(1), 20–26 (2013)
3. Bhatt, S.N., Chung, F.R., Leighton, F.T., Rosenberg, A.L.: Efficient embeddings of trees in hypercubes. SIAM J. Comput. 21(1), 151–162 (1992)
4. Bookstein, A., Kulyukin, V.A., Raita, T.: Generalized hamming distance. Inf. Retr. 5(4), 353–375 (2002)
5. Graham, R.L., Hell, P.: On the history of the minimum spanning tree problem. Ann. Hist. Comput. 7(1), 43–57 (1985)