Node-Visit Optimal 1-2 Brother Trees

Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood. Node-Visit Optimal 1-2 Brother Trees. In Klaus Weihrauch, editor, Theoretical Computer Science, 4th GI-Conference, Aachen, Germany, March 26-28, 1979, Proceedings. Volume 67 of Lecture Notes in Computer Science, pages 213-221, Springer, 1979.

@inproceedings{OttmannRSW79,
  title = {Node-Visit Optimal 1-2 Brother Trees},
  author = {Thomas Ottmann and Arnold L. Rosenberg and Hans-Werner Six and Derick Wood},
  year = {1979},
  researchr = {https://researchr.org/publication/OttmannRSW79},
  cites = {0},
  citedby = {0},
  pages = {213-221},
  booktitle = {Theoretical Computer Science, 4th GI-Conference, Aachen, Germany, March 26-28, 1979, Proceedings},
  editor = {Klaus Weihrauch},
  volume = {67},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-09118-1},
}