Efficient polynomial-time algorithms for special graph partitioning problems (Q2877347)
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: Efficient polynomial-time algorithms for special graph partitioning problems |
scientific article; zbMATH DE number 6333580
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient polynomial-time algorithms for special graph partitioning problems |
scientific article; zbMATH DE number 6333580 |
Statements
22 August 2014
0 references
polynomial-time solvable optimization problems
0 references
Ising spin glasses
0 references
maximum weight matching problem on planar graphs
0 references
Efficient polynomial-time algorithms for special graph partitioning problems (English)
0 references
0.8369079232215881
0 references
0.7916784882545471
0 references
0.7816659212112427
0 references
0.7816659212112427
0 references
0.7651731967926025
0 references
