Book
Open access
Jul 2026
A Practical Parallel Algorithm for Expander Decompositions
A work-efficient parallel algorithm for expander decompositions whose main cut-finding procedure requires no flow computations, and which shows that a weak expander decomposition for any target expansion Φ can be extracted from a hierarchical congestion approximator in linear time.
Robin Münk
· ACM Symposium on Parallelism... · 0 citations