Network-based dissolution

R. Bevern, van, R. Bredereck, J. Chen, V. Froese, R. Niedermeier, G.J. Woeginger

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review


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.
Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 2014 (39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II)
EditorsE. Csuhaj-Varjú, M. Dietzfelbinger, Z. Ésik
Place of PublicationBerlin
ISBN (Print)978-3-662-44464-1
Publication statusPublished - 2014
Event39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014) - Budapest, Hungary
Duration: 25 Aug 201429 Aug 2014
Conference number: 39

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743


Conference39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014)
Abbreviated titleMFCS 2014


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

Cite this