Tree edge decomposition with an application to minimum ultrametric tree approximation
From MaRDI portal
Publication:2369981
DOI10.1007/s10878-006-9626-zzbMath1139.05015MaRDI QIDQ2369981
Chang-Biau Yang, Chia-Mao Huang, Bang Ye Wu
Publication date: 21 June 2007
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-006-9626-z
90C35: Programming involving graphs or networks
05C05: Trees
68R10: Graph theory (including graph drawing) in computer science
Related Items
Cites Work
- Unnamed Item
- Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices
- A robust model for finding optimal evolutionary tree
- Shifting algorithms for tree partitioning with general weighting functions
- Max-Min Tree Partitioning
- A Shifting Algorithm for Min-Max Tree Partitioning
- A Linear Tree Partitioning Algorithm
- Algorithms on Strings, Trees and Sequences
- Optimal Search in Trees