Pages that link to "Item:Q831130"
From MaRDI portal
The following pages link to Algorithms for gerrymandering over graphs (Q831130):
Displaying 4 items.
- Gerrymandering on graphs: computational complexity and parameterized algorithms (Q2670918) (← 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)