Multi-way sparsest cut problem on trees with a control on the number of parts and outliers (Q2217481)

From MaRDI portal
Revision as of 19:20, 1 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Multi-way sparsest cut problem on trees with a control on the number of parts and outliers
scientific article

    Statements

    Multi-way sparsest cut problem on trees with a control on the number of parts and outliers (English)
    0 references
    0 references
    0 references
    29 December 2020
    0 references
    sparsest cut problem
    0 references
    isoperimetric number
    0 references
    Cheeger constant
    0 references
    normalized cut
    0 references
    graph partitioning
    0 references
    computational complexity
    0 references
    weighted trees
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references