Maintaining expander decompositions via sparse cuts
From MaRDI portal
Publication:6538527
Cited in
(5)- On the streaming complexity of expander decomposition
- Practical expander decomposition
- Length-constrained directed expander decomposition and length-constrained vertex-capacitated flow shortcuts
- Near-optimal directed low-diameter decompositions
- Near-optimal algorithm for directed expander decompositions
This page was built for publication: Maintaining expander decompositions via sparse cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6538527)