Network-based dissolution

DOI10.1007/978-3-662-44465-8_7MaRDI QIDQ2922597zbMATH OpenOpenAlexFDO

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

Publication date 14 October 2014

Published in Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-44465-8_7

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Network-based vertex dissolution
• Algorithms for gerrymandering over graphs
• Fair redistricting is hard
• The complexity of gerrymandering over graphs: paths and trees
• A graph partitioning model of congressional redistricting

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A computational approach to unbiased districting
• A fair division solution to the problem of redistricting
• A spanning tree heuristic for regional clustering
• An optimization based heuristic for political districting
• Combinatorial and computational aspects of graph packing and graph decomposition
• Generalized planar matching
• Multiplying matrices faster than coppersmith-winograd
• On Restricted Two-Factors
• Optimal redistricting under geographical constraints: why ``pack and crack does not work

Cited in

(1)

• Network-based vertex dissolution

This page was built for publication: Network-based dissolution

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