The complexity of gerrymandering over graphs: paths and trees (Q5918559): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Bicolored graph partitioning, or: gerrymandering at its worst / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Gerrymandering on graphs: computational complexity and parameterized algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for gerrymandering over graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Editing graphs to satisfy degree constraints: a parameterized approach / rank | |||
Normal rank | |||
Revision as of 19:04, 30 July 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
