2 papers
cs.DS2026
Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs
David Gamarnik, Miklós Z. Rácz, Gabe Schoenbach
We study the problem of efficiently finding large common induced subgraphs of two independent ErdÅs--Rényi random graphs . Recently, Chatterjee a…
cs.DM2026
The Balanced Up-Down Walk
Hugo A. Akitaya, Sarah Cannon, Gregory Herschlag +3
Markov chains based on spanning trees have been hugely influential in algorithms for assessing fairness in political redistricting. The input graph represents the geographic buildi…