On some relations between 2-trees and tree metrics
From MaRDI portal
Publication:1584450
DOI10.1016/S0012-365X(98)00073-9zbMATH Open0958.05029OpenAlexW2057711015MaRDI QIDQ1584450FDOQ1584450
Authors: Bruno Leclerc, Vladimir Makarenkov 
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00073-9
Recommendations
Cites Work
- A note on two problems in connexion with graphs
- Tree structures for proximity data
- Unrooted trees for numerical taxonomy
- Title not available (Why is that?)
- Recognition of Tree Metrics
- Symmetric Matrices Representable by Weighted Trees over a Cancellative Abelian Monoid
- Title not available (Why is that?)
- On acyclic simplicial complexes
- The number of labeled k-dimensional trees
- The number of labeled k-trees
- The distance matrix of a graph and its tree realization
- Median linear orders: Heuristics and a branch and bound algorithm
- Minimum spanning trees for tree metrics: Abridgements and adjustments
- Title not available (Why is that?)
- An Optimal Diagonal Tree Code
- Title not available (Why is that?)
- SPANNING TREES AND ASPECTS OF CLUSTERING
- Minimum spanning trees and types of dissimilarities
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- Combinatorial properties of triplet covers for binary trees
- On the extension of a partial metric to a tree metric
- Minimum triplet covers of binary phylogenetic \(X\)-trees
- Some results on metric trees
- The specification of 2-trees
- The triangles method to build \(X\)-trees from incomplete distance matrices
This page was built for publication: On some relations between 2-trees and tree metrics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584450)
