The complexity of gerrymandering over graphs: paths and trees

DOI10.1007/978-3-030-86838-3_15OpenAlexW3202008368MaRDI QIDQ5925552

Rolf Niedermeier, Tomohiro Koana, Matthias Bentert

Publication date: 8 June 2022

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.08905

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Priced gerrymandering

Cites Work

• Unnamed Item
• Editing graphs to satisfy degree constraints: a parameterized approach
• On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering
• Algorithms for gerrymandering over graphs
• Bicolored graph partitioning, or: gerrymandering at its worst

This page was built for publication: The complexity of gerrymandering over graphs: paths and trees