Efficient Embedding K-ary Complete Trees into Hypercubes

Xiaojun Shen, Qing Hu, Weifa Liang. Efficient Embedding K-ary Complete Trees into Hypercubes. In Howard Jay Siegel, editor, Proceedings of the 8th International Symposium on Parallel Processing, CancĂșn, Mexico, April 1994. pages 710-714, IEEE Computer Society, 1994.

@inproceedings{ShenHL94,
  title = {Efficient Embedding K-ary Complete Trees into Hypercubes},
  author = {Xiaojun Shen and Qing Hu and Weifa Liang},
  year = {1994},
  tags = {completeness},
  researchr = {https://researchr.org/publication/ShenHL94},
  cites = {0},
  citedby = {0},
  pages = {710-714},
  booktitle = {Proceedings of the 8th International Symposium on Parallel Processing, CancĂșn, Mexico, April 1994},
  editor = {Howard Jay Siegel},
  publisher = {IEEE Computer Society},
  isbn = {0-8186-5602-6},
}