A note on tree realizations of matrices
From MaRDI portal
Publication:3515389
DOI10.1051/ro:2007028zbMath1143.05314OpenAlexW2154857537MaRDI QIDQ3515389
Publication date: 29 July 2008
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=RO_2007__41_4_361_0
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Uses Software
Cites Work
- Unnamed Item
- A fast algorithm for constructing trees from distance matrices
- Trees related to realizations of distance matrices
- A note on the metric properties of trees
- A robust model for finding optimal evolutionary tree
- The distance matrix of a graph and its tree realization
- Recognition of Tree Metrics
- Distance matrix of a graph and its realizability
- A note on the tree realizability of a distance matrix
This page was built for publication: A note on tree realizations of matrices