Network-based vertex dissolution

René Van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)

Abstract

We introduce a graph-theoretic vertex 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 load to neighboring vertices in a completely balanced way. We investigate how the underlying graph structure, the 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.

Original languageEnglish
Pages (from-to)888-914
Number of pages27
JournalSIAM Journal on Discrete Mathematics
Volume29
Issue number2
DOIs
Publication statusPublished - 1 Jan 2015
Externally publishedYes

Keywords

  • Combinatorial algorithms
  • Computational complexity analysis
  • Economization
  • Election control
  • Flow networks
  • Matching
  • NP-hard problems
  • Political districting
  • Redistribution scenarios

Fingerprint Dive into the research topics of 'Network-based vertex dissolution'. Together they form a unique fingerprint.

Cite this