Fast algorithms for directed graph partitioning using flows and reweighted eigenvalues
From MaRDI portal
Cited in
(4)- A simpler and parallelizable \(O(\sqrt{\log n})\)-approximation algorithm for \textsc{Sparsest Cut}
- On the houdré-tetali conjecture about an isoperimetric constant of graphs
- Submodular hypergraph partitioning: metric relaxations and fast algorithms via an improved cut-matching game
- On the spectral expansion of monotone subsets of the hypercube
This page was built for publication: Fast algorithms for directed graph partitioning using flows and reweighted eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6645367)
