Expander Decomposition and Pruning: Faster, Stronger, and Simpler

DOI10.1137/1.9781611975482.162zbMath1430.68238arXiv1812.08958OpenAlexW2903365982MaRDI QIDQ5236352

No author found.

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.08958

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Faster connectivity in low-rank hypergraphs via expander decomposition ⋮ Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions ⋮ Local Flow Partitioning for Faster Edge Connectivity

This page was built for publication: Expander Decomposition and Pruning: Faster, Stronger, and Simpler