The complexity of gerrymandering over graphs: paths and trees (Q5918559): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2022.09.009 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2022.09.009 / rank | |||
Normal rank | |||
Latest revision as of 01:10, 17 December 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
0 references
