Cardinality constrained minimum cut problems: complexity and algorithms. (Q1427809)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Cardinality constrained minimum cut problems: complexity and algorithms. |
scientific article; zbMATH DE number 2056037
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cardinality constrained minimum cut problems: complexity and algorithms. |
scientific article; zbMATH DE number 2056037 |
Statements
Cardinality constrained minimum cut problems: complexity and algorithms. (English)
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
