2 papers
cs.DS2024
A Uniformly Random Solution to Algorithmic Redistricting
Jin-Yi Cai, Jacob Kruse, Kenneth Mayer +1
The process of drawing electoral district boundaries is known as political redistricting. Within this context, gerrymandering is the practice of drawing these boundaries such that…
math.CO2024
Diameter reduction via arc reversal
Panna Gehér, Max Kölbl, Lydia Mirabel Mendoza-Cadena +1
The diameter of a directed graph is the maximum distance between any pair of vertices. We study a problem that generalizes \textsc{Oriented Diameter}: For a given directed graph an…