14 citations · 14 across the 14 of their papers we have counts for
1 paper · 2 filters
Samuel Talkington, Dmitrii M. Ostrovskii, Daniel K. Molzahn
We present an algorithm that efficiently computes nearly-optimal solutions to a class of combinatorial reconfiguration problems on weighted, undirected graphs. Inspired by societal…