Optimal cuts and partitions in tree metrics in polynomial time (Q396629)

From MaRDI portal
Revision as of 22:11, 8 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Optimal cuts and partitions in tree metrics in polynomial time
scientific article

    Statements

    Optimal cuts and partitions in tree metrics in polynomial time (English)
    0 references
    0 references
    0 references
    0 references
    13 August 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    optimal cut
    0 references
    optimal bisection
    0 references
    tree metric
    0 references
    geometric metric
    0 references
    polynomial time
    0 references
    0 references
    0 references