Parameterized complexity of gerrymandering
type: Item
instance of: scholarly article
title: Parameterized complexity of gerrymandering
zbMATH Open document ID: 1539.91109
DOI: 10.1007/978-3-031-43254-5_8
author: Andrew Fraser
author: Brian Lavallee
author: Blair D. Sullivan
publication date: 2024-05-29T00:00:00Z
Mathematics Subject Classification ID: 91F10
Mathematics Subject Classification ID: 91B12
Mathematics Subject Classification ID: 68Q27
zbMATH DE Number: 7855679
zbMATH Keywords: gerrymandering
zbMATH Keywords: parameterized complexity
zbMATH Keywords: graph algorithms
MaRDI profile type: MaRDI publication profile
cites work: The complexity of gerrymandering over graphs: paths and trees
cites work: Parameterized Algorithms
cites work: Parametrized complexity theory.
cites work: Gerrymandering on graphs: computational complexity and parameterized algorithms
cites work: Algorithms for gerrymandering over graphs
cites work: Structured proportional representation
description: scientific article; zbMATH DE number 7855679