Optimal leaf ordering of complete binary trees

Journal of Discrete Algorithms

Volumn 5, Issue 3, 2007, Pages 546-552

  Brandes, Ulrik ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

Bit manipulation algorithms; Optimal leaf ordering; Permutations

Indexed keywords

ALGORITHMS; ASYMPTOTIC ANALYSIS; BOUNDARY CONDITIONS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

BIT-MANIPULATION ALGORITHMS; OPTIMAL LEAF ORDERING; PERMUTATIONS;

TREES (MATHEMATICS);

EID: 34248679043     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2006.09.003     Document Type: Article

References (4)

1. Burkhard R., Deǐneko V.G., and Woeginger G. The travelling salesman and the PQ-tree. Mathematics of Operations Research 24 1 (1999) 262-272
2. Bar-Joseph Z., Demaine E.D., Gifford D.K., Srebro N., Hamel A.M., and Jaakkola T.S. K-ary clustering with optimal leaf ordering for gene expression data. Bioinformatics 19 9 (2003) 1070-1078
3. Bar-Joseph Z., and Cohen-Or D. Hierarchical context-based pixel ordering. Proceedings of EUROGRAPHICS. Computer Graphics Forum 22 3 (2003) 349-358
4. V.G. Deǐneko, A. Tiskin, Double-tree approximations for metric TSP: Is the best one good enough? Mathematics of Operations Research, submitted for publication