Bicolored graph partitioning, or: gerrymandering at its worst

DOI10.1016/j.dam.2009.06.016zbMath1227.91018OpenAlexW2020848182MaRDI QIDQ967425

Nicola Apollonio, Bruno Simeone, Federica Ricca, Ronald I. Becker, Isabella Lari

Publication date: 28 April 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.06.016

zbMATH Keywords

graph coloringgraph partitioninggerrymandering

Mathematics Subject Classification ID

Voting theory (91B12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) History, political science (91F10) Coloring of graphs and hypergraphs (05C15)

Related Items

Algorithms for gerrymandering over graphs ⋮ Balanced connected graph partition ⋮ Constraint-based electoral districting using a new compactness measure: an application to Portugal ⋮ Reconfiguration of connected graph partitions ⋮ Complexity and inapproximability results for balanced connected subgraph problem ⋮ The complexity of gerrymandering over graphs: paths and trees ⋮ The complexity of gerrymandering over graphs: paths and trees ⋮ A discrete districting plan

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of partitioning graphs into connected subgraphs
• Evaluation and Optimization of Electoral Systems