On cuts and matchings in planar graphs (Q688915)
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: On cuts and matchings in planar graphs |
scientific article; zbMATH DE number 438791
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On cuts and matchings in planar graphs |
scientific article; zbMATH DE number 438791 |
Statements
On cuts and matchings in planar graphs (English)
0 references
1 November 1993
0 references
cut polytope
0 references
multicommodity flows
0 references
max cut problem
0 references
optimum perfect matchings
0 references
planar graphs
0 references
0 references
0.8163208961486816
0 references
0.8108532428741455
0 references
0.7939631938934326
0 references
0.7939629554748535
0 references
