Network-based vertex dissolution

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

Результат исследования: Научные публикации в периодических изданияхстатья

5 Цитирования (Scopus)

Аннотация

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.

Язык оригиналаанглийский
Страницы (с-по)888-914
Число страниц27
ЖурналSIAM Journal on Discrete Mathematics
Том29
Номер выпуска2
DOI
СостояниеОпубликовано - 1 янв 2015
Опубликовано для внешнего пользованияДа

Fingerprint Подробные сведения о темах исследования «Network-based vertex dissolution». Вместе они формируют уникальный семантический отпечаток (fingerprint).

Цитировать