A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube

Volker Heun, Ernst W. Mayr. A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube. J. Algorithms, 20(2):375-399, 1996.

@article{HeunM96:2,
  title = {A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube},
  author = {Volker Heun and Ernst W. Mayr},
  year = {1996},
  researchr = {https://researchr.org/publication/HeunM96%3A2},
  cites = {0},
  citedby = {0},
  journal = {J. Algorithms},
  volume = {20},
  number = {2},
  pages = {375-399},
}