Bicolored graph partitioning, or: gerrymandering at its worst
From MaRDI portal
Publication:967425
DOI10.1016/j.dam.2009.06.016zbMath1227.91018MaRDI 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
91B12: Voting theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
91F10: History, political science
05C15: Coloring of graphs and hypergraphs
Related Items
The complexity of gerrymandering over graphs: paths and trees, The complexity of gerrymandering over graphs: paths and trees, Reconfiguration of connected graph partitions, Algorithms for gerrymandering over graphs, Balanced connected graph partition, Complexity and inapproximability results for balanced connected subgraph problem, A discrete districting plan, Constraint-based electoral districting using a new compactness measure: an application to Portugal
Cites Work