Cardinality constrained minimum cut problems: complexity and algorithms. (Q1427809): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CSDP / rank | |||
Normal rank | |||
Revision as of 23:16, 29 February 2024
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
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
