Practical expander decomposition

Cites work

scientific article; zbMATH DE number 3349645 (Why is no real title available?)
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and beyond
A deterministic almost-linear time algorithm for minimum-cost flow
A nearly optimal all-pairs min-cuts algorithm in simple graphs
A simple deterministic algorithm for edge connectivity
APMF < APSP? Gomory-Hu tree for unweighted graphs in almost-quadratic time
All-pairs max-flow is no harder than single-pair max-flow: Gomory-Hu trees in almost-linear time
Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs
An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations
Computing cut-based hierarchical decompositions in almost linear time
Derandomizing directed random walks in almost-linear time
Deterministic Edge Connectivity in Near-Linear Time
Deterministic mincut in almost-linear time
Dynamic minimum spanning forest with subpolynomial worst-case update time
Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and $O(n^{1/2-\epsilon})$-time
Efficient $\widetilde{O}(n/\epsilon)$ Spectral Sketches for the Laplacian and its Pseudoinverse
Expander decomposition and pruning: faster, stronger, and simpler
Expander decomposition with fewer inter-cluster edges using a spectral cut player
Fully-dynamic minimum spanning forest with improved worst-case update time
Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions
Graph partitioning using single commodity flows
Local flow partitioning for faster edge connectivity
Maintaining expander decompositions via sparse cuts
Maximum flow and minimum-cost flow in almost-linear time
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
On clusterings: good, bad and spectral
On sketching quadratic forms
The University of Florida sparse matrix collection
Vertex connectivity in poly-logarithmic max-flows

This page was built for publication: Practical expander decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253122)