Skip to main content
Conference Proceedings

Node-visit optimal 1 – 2 brother trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1979) 67 LNCS 213-221
DOI: 10.1007/3-540-09118-1_23
0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We characterize node-visit optimal 1–2 brother trees and present a linear time algorithm to construct them.

Cite

CITATION STYLE

APA

Ottmann, T., Rosenberg, A. L., Six, H. W., & Wood, D. (1979). Node-visit optimal 1 – 2 brother trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 67 LNCS, pp. 213–221). Springer Verlag. https://doi.org/10.1007/3-540-09118-1_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free