The triangles method to build<i>X</i>-trees from incomplete distance matrices (Q2773174): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4004055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic simplicial complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm to reconstruct trees from additive distance data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum spanning trees for tree metrics: Abridgements and adjustments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some relations between 2-trees and tree metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5580179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating subgraphs in k-trees: Cables and caterpillars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of phylogenetic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simple characterizations of k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A <i>k</i>-Tree Generalization that Characterizes Consistency of Dimensioned Engineering Drawings / rank
 
Normal rank

Latest revision as of 22:03, 3 June 2024

scientific article
Language Label Description Also known as
English
The triangles method to build<i>X</i>-trees from incomplete distance matrices
scientific article

    Statements

    Identifiers