The complexity of gerrymandering over graphs: paths and trees (Q5918559)
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: The complexity of gerrymandering over graphs: paths and trees |
scientific article; zbMATH DE number 7615632
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of gerrymandering over graphs: paths and trees |
scientific article; zbMATH DE number 7615632 |
Statements
The complexity of gerrymandering over graphs: paths and trees (English)
0 references
11 November 2022
0 references
graph algorithms
0 references
NP-hardness
0 references
multiparty elections
0 references
bounded-diameter graphs
0 references
