Parameterized complexity of gerrymandering

DOI10.1007/978-3-031-43254-5_8zbMATH Open1539.91109MaRDI QIDQ6546281

Brian Lavallee, Andrew Fraser, Blair D. Sullivan

Publication date: 29 May 2024

zbMATH Keywords

graph algorithmsparameterized complexitygerrymandering

Mathematics Subject Classification ID

Voting theory (91B12) History, political science (91F10) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Algorithms for gerrymandering over graphs
• Structured proportional representation
• Parametrized complexity theory.
• Gerrymandering on graphs: computational complexity and parameterized algorithms
• Parameterized Algorithms
• The complexity of gerrymandering over graphs: paths and trees

This page was built for publication: Parameterized complexity of gerrymandering

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