Network-Based Dissolution

DOI10.1007/978-3-662-44465-8_7zbMath1426.68226OpenAlexW127106243MaRDI QIDQ2922597

Vincent Froese, Jiehua Chen, Robert Bredereck, Rolf Niedermeier, René van Bevern, 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)

Cites Work

• Unnamed Item
• Combinatorial and computational aspects of graph packing and graph decomposition
• A fair division solution to the problem of redistricting
• Optimal redistricting under geographical constraints: why ``pack and crack does not work
• A computational approach to unbiased districting
• An Optimization Based Heuristic for Political Districting
• Generalized planar matching
• On Restricted Two-Factors
• A spanning tree heuristic for regional clustering
• Star Partitions of Perfect Graphs
• Multiplying matrices faster than coppersmith-winograd

This page was built for publication: Network-Based Dissolution