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 the normal view instead:
scientific article; zbMATH DE number 2056037
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8521866798400879
0 references
0.814821183681488
0 references
0.7955092787742615
0 references
0.7882122993469238
0 references
