An algorithm for tree-realizability of distance matrices∗
From MaRDI portal
Publication:3477951
DOI10.1080/00207169008803874zbMath0699.68056OpenAlexW2013896824MaRDI QIDQ3477951
Tomaž Pisanski, Vladimir Batagelj, J. M. S. Simões-Pereira
Publication date: 1990
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169008803874
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Related Items
Comparing resemblance measures ⋮ Nodal distances for rooted phylogenetic trees ⋮ A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem ⋮ Recognizing and realizing cactus metrics ⋮ \(l_\infty\)-approximation via subdominants.
Cites Work
- On optimal embeddings of metrics in graphs
- A fast algorithm for constructing trees from distance matrices
- A note on distance matrices with unicyclic graph realizations
- Submatrices of non-tree-realizable distance matrices
- A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices
- A note on the tree realizability of a distance matrix