Weighted graphs with distances in given ranges
From MaRDI portal
Publication:333343
DOI10.1007/s00357-016-9206-6zbMath1349.05061arXiv1409.3863OpenAlexW2219007574MaRDI QIDQ333343
Publication date: 28 October 2016
Published in: Journal of Classification (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.3863
Related Items (3)
A characterization of distance matrices of weighted cubic graphs and Peterson graphs ⋮ Composed degree-distance realizations of graphs ⋮ Composed degree-distance realizations of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Recognizing treelike \(k\)-dissimilarities
- Families of multiweights and pseudostars
- On graphlike \(k\)-dissimilarity vectors
- On dissimilarity vectors of general weighted trees
- Sets of double and triple weights of trees
- A tropical interpretation of \(m\)-dissimilarity maps
- Reconstructing trees from subtree weights.
- A note on the metric properties of trees
- Dissimilarity vectors of trees are contained in the tropical Grassmannian
- Basic Phylogenetic Combinatorics
- Tree structures for proximity data
- The distance matrix of a graph and its tree realization
- Symmetric Matrices Representable by Weighted Trees over a Cancellative Abelian Monoid
- Distance matrix of a graph and its realizability
- A note on the tree realizability of a distance matrix
This page was built for publication: Weighted graphs with distances in given ranges