Pages that link to "Item:Q5918559"
From MaRDI portal
The following pages link to The complexity of gerrymandering over graphs: paths and trees (Q5918559):
Displaying 5 items.
- On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering (Q782765) (← links)
- Algorithms for gerrymandering over graphs (Q831130) (← links)
- Bicolored graph partitioning, or: gerrymandering at its worst (Q967425) (← links)
- Priced gerrymandering (Q6093576) (← links)
- Parameterized complexity of gerrymandering (Q6546281) (← links)