The complexity of gerrymandering over graphs: paths and trees (Q5918559): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:46, 1 February 2024
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
