Jan Trdlicka, Pavel Tvrdík. Embedding complete k-ary trees into k-square 2-D meshes with optimal edge congestion. Parallel Computing, 26(6):783-790, 2000.
@article{TrdlickaT00,
title = {Embedding complete k-ary trees into k-square 2-D meshes with optimal edge congestion},
author = {Jan Trdlicka and Pavel Tvrdík},
year = {2000},
tags = {completeness},
researchr = {https://researchr.org/publication/TrdlickaT00},
cites = {0},
citedby = {0},
journal = {Parallel Computing},
volume = {26},
number = {6},
pages = {783-790},
}