On the weights of simple paths in weighted complete graphs
From MaRDI portal
Publication:384869
DOI10.1007/s13226-013-0027-6zbMath1277.05079arXiv1210.0845OpenAlexW2063784257MaRDI QIDQ384869
Publication date: 29 November 2013
Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.0845
Cites Work
- Recognizing treelike \(k\)-dissimilarities
- On graphlike \(k\)-dissimilarity vectors
- On dissimilarity vectors of general weighted trees
- `Lassoing' a phylogenetic tree. I: Basic properties, shellings, and covers
- Sets of double and triple weights of trees
- Reconstructing trees from subtree weights.
- A note on the metric properties of trees
- Hereditarily optimal realizations of consistent metrics
- Basic Phylogenetic Combinatorics
- 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: On the weights of simple paths in weighted complete graphs
