We introduce a graph-theoretic dissolution model that applies to a number of redistribution scenarios such as gerrymandering in political districting or work balancing in an online situation. The central aspect of our model is the deletion of certain vertices and the redistribution of their loads to neighboring vertices in a perfectly balanced way.
We investigate how the underlying graph structure, the pre-knowledge of which vertices should be deleted, and the relation between old and new vertex loads influence the computational complexity of the underlying graph problems. Our results establish a clear borderline between tractable and intractable cases.
KeywordsPlanar Graph Undirected Graph Neighborhood Graph Complexity Dichotomy Exact Cover
Unable to display preview. Download preview PDF.
- 1.Altman, M.: Districting Principles and Democratic Representation. PhD thesis, California Institute of Technology (1998)Google Scholar
- 4.Duque, J.C.: Design of Homogeneous Territorial Units: A Methodological Proposal and Applications. PhD thesis, University of Barcelona (2004)Google Scholar
- 6.Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman (1979)Google Scholar
- 13.Vassilevska Williams, V.: Multiplying matrices faster than Coppersmith-Winograd. In: Proc. 44th STOC, pp. 887–898. ACM (2012)Google Scholar