Simple Length-Constrained Expander Decompositions

Greg Bodwin, Bernhard Haeupler, D Ellis Hershkowitz +1

Length-constrained expander decompositions are a new graph decomposition that has led to several recent breakthroughs in fast graph algorithms. Roughly, an $(h,s)$-length $\ddot{I}•$-exp…