On the weights of simple paths in weighted complete graphs (Q384869): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On graphlike \(k\)-dissimilarity vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric Matrices Representable by Weighted Trees over a Cancellative Abelian Monoid / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the metric properties of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: `Lassoing' a phylogenetic tree. I: Basic properties, shellings, and covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hereditarily optimal realizations of consistent metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basic Phylogenetic Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance matrix of a graph and its realizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing treelike \(k\)-dissimilarities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing trees from subtree weights. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets of double and triple weights of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dissimilarity vectors of general weighted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the tree realizability of a distance matrix / rank
 
Normal rank

Revision as of 02:23, 7 July 2024

scientific article
Language Label Description Also known as
English
On the weights of simple paths in weighted complete graphs
scientific article

    Statements

    Identifiers