Solving Partition Problems Almost Always Requires Pushing Many Vertices Around (Q5220192)
From MaRDI portal
scientific article; zbMATH DE number 7179077
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
