The complexity of gerrymandering over graphs: paths and trees

DOI10.1007/978-3-030-86838-3_15MaRDI QIDQ5925552zbMATH OpenOpenAlexFDO

Authors Matthias Bentert, Tomohiro Koana, Rolf Niedermeier

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)

Cites work

• Algorithms for gerrymandering over graphs
• Bicolored graph partitioning, or: gerrymandering at its worst
• Editing graphs to satisfy degree constraints: a parameterized approach
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering

Cited in

(1)

• Priced gerrymandering

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5925552)