Pages that link to "Item:Q831130"
From MaRDI portal
The following pages link to Algorithms for gerrymandering over graphs (Q831130):
Displaying 14 items.
- Metropolized Forest Recombination for Monte Carlo Sampling of Graph Partitions (Q58516) (← links)
- On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering (Q782765) (← links)
- Bicolored graph partitioning, or: gerrymandering at its worst (Q967425) (← links)
- Optimal redistricting under geographical constraints: why ``pack and crack'' does not work (Q1046263) (← links)
- Optimal partisan districting on planar geographies (Q1642801) (← links)
- A discrete districting plan (Q2303654) (← links)
- Gerrymandering on graphs: computational complexity and parameterized algorithms (Q2670918) (← links)
- Gerrymandering and Convexity (Q2999704) (← links)
- Redistricting algorithms (Q5050043) (← links)
- A fast sorting algorithm to redistricting election model (Q5320504) (← links)
- The complexity of gerrymandering over graphs: paths and trees (Q5918559) (← links)
- The complexity of gerrymandering over graphs: paths and trees (Q5925552) (← links)
- Priced gerrymandering (Q6093576) (← links)
- Parameterized complexity of gerrymandering (Q6546281) (← links)