Cardinality constrained minimum cut problems: complexity and algorithms. (Q1427809): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0166-218x(03)00358-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1966902774 / rank | |||
Normal rank | |||
Latest revision as of 10:54, 30 July 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
0 references
0 references
0 references
