The following pages link to An Optimal Diagonal Tree Code (Q4750658):
Displaying 11 items.
- Tree reconstruction from triplet cover distances (Q405205) (← links)
- `Lassoing' a phylogenetic tree. I: Basic properties, shellings, and covers (Q455729) (← links)
- On optimal embeddings of metrics in graphs (Q794666) (← links)
- Linear time tree codes (Q799118) (← links)
- On optimal realizations of finite metric spaces by graphs (Q1100481) (← links)
- A fast algorithm for constructing trees from distance matrices (Q1116346) (← links)
- A note on distance matrices with unicyclic graph realizations (Q1121283) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- On some relations between 2-trees and tree metrics (Q1584450) (← links)
- Minimum spanning trees for tree metrics: Abridgements and adjustments (Q1907943) (← links)
- A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices (Q3320428) (← links)
