Solving partition problems almost always requires pushing many vertices around (Q5220192)
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 partition problems almost always requires pushing many vertices around |
scientific article; zbMATH DE number 7179077
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving partition problems almost always requires pushing many vertices around |
scientific article; zbMATH DE number 7179077 |
Statements
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around (English)
0 references
11 March 2020
0 references
polynomial kernel
0 references
graph partitioning
0 references
monopolar graphs
0 references
0 references
0.7645224928855896
0 references
0.7562038898468018
0 references
0.7482630014419556
0 references
0.746485710144043
0 references
0.7456759214401245
0 references
