Cardinality constrained minimum cut problems: complexity and algorithms. (Q1427809)

From MaRDI portal
Revision as of 10:54, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Cardinality constrained minimum cut problems: complexity and algorithms.
scientific article

    Statements

    Cardinality constrained minimum cut problems: complexity and algorithms. (English)
    0 references
    0 references
    0 references
    0 references
    14 March 2004
    0 references
    Cut problems
    0 references
    \(k\)-cardinality minimum cut
    0 references
    Cardinality
    0 references
    constrained combinatorial optimization
    0 references
    Computational complexity
    0 references
    Semidefinite programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers