Solving minimum K-cardinality cut problems in planar graphs (Q3418207)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving minimum K-cardinality cut problems in planar graphs |
scientific article |
Statements
Solving minimum K-cardinality cut problems in planar graphs (English)
0 references
2 February 2007
0 references
cut problems
0 references
minimum \(k\)-cardinality cut
0 references
Lagrangian relaxation
0 references
exact perfect matching
0 references
planar graphs
0 references
semidefinite programming
0 references
