Pages that link to "Item:Q967425"
From MaRDI portal
The following pages link to Bicolored graph partitioning, or: gerrymandering at its worst (Q967425):
Displaying 8 items.
- Algorithms for gerrymandering over graphs (Q831130) (← links)
- Balanced connected graph partition (Q831759) (← links)
- Complexity and inapproximability results for balanced connected subgraph problem (Q2232593) (← links)
- A discrete districting plan (Q2303654) (← links)
- Constraint-based electoral districting using a new compactness measure: an application to Portugal (Q2676289) (← links)
- The complexity of gerrymandering over graphs: paths and trees (Q5918559) (← links)
- The complexity of gerrymandering over graphs: paths and trees (Q5925552) (← links)
- Reconfiguration of connected graph partitions (Q6093138) (← links)
