Minimum spanning trees for tree metrics: Abridgements and adjustments (Q1907943): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Recognition of Tree Metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3746709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Diagonal Tree Code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4849939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3308895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: SPANNING TREES AND ASPECTS OF CLUSTERING / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3933032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677186 / rank
 
Normal rank

Latest revision as of 10:46, 24 May 2024

scientific article
Language Label Description Also known as
English
Minimum spanning trees for tree metrics: Abridgements and adjustments
scientific article

    Statements

    Minimum spanning trees for tree metrics: Abridgements and adjustments (English)
    0 references
    0 references
    0 references
    25 February 1996
    0 references
    0 references
    0 references
    0 references
    0 references
    ultra metric
    0 references
    Robinson dissimilarity
    0 references
    fitting algorithm
    0 references
    combinatorial data analysis
    0 references
    tree metrics
    0 references
    degrees of freedom
    0 references
    Robinson form
    0 references
    minimum spanning tree
    0 references
    dissimilarities
    0 references