1 paper
Yiding Hua, Rasmus Kyng, Maximilian Probst Gutenberg +1
In this article, we show that the algorithm of maintaining expander decompositions in graphs undergoing edge deletions directly by removing sparse cuts repeatedly can be made effic…