Search papers, labs, and topics across Lattice.
1
0
1
11
A surprisingly simple weight-transfer trick unlocks a near-optimal deterministic algorithm for finding balanced separators in planar graphs, potentially derandomizing a suite of distributed algorithms for problems like shortest paths and max-flow.
