Solving minimum K-cardinality cut problems in planar graphs (Q3418207)
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: Solving minimum K-cardinality cut problems in planar graphs |
scientific article; zbMATH DE number 5121321
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving minimum K-cardinality cut problems in planar graphs |
scientific article; zbMATH DE number 5121321 |
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
0.8521866798400879
0 references
0.8318451046943665
0 references
0.8222283720970154
0 references
0.8214910626411438
0 references
0.8207507729530334
0 references
