Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180)
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: Partitioning planar graphs: a fast combinatorial approach for max-cut |
scientific article; zbMATH DE number 6053923
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning planar graphs: a fast combinatorial approach for max-cut |
scientific article; zbMATH DE number 6053923 |
Statements
Partitioning planar graphs: a fast combinatorial approach for max-cut (English)
0 references
10 July 2012
0 references
maximum cut
0 references
planar graph
0 references
perfect matching
0 references
Kasteleyn city
0 references
T-join
0 references
0 references
0 references
0 references
