A new approach to computing maximum flows using electrical flows
From MaRDI portal
Recommendations
- Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs
- A new approach to the maximum-flow problem
- Electrical flows over spanning trees
- Computational investigations of maximum flow algorithms
- Maximum flow problem in the distribution network
- A Fast Parametric Maximum Flow Algorithm and Applications
- A fast maximum flow algorithm
- The maximum flow problem: A max-preflow approach
- Faster energy maximization for faster maximum flow
- scientific article; zbMATH DE number 706868
Cited in
(27)- Exact and approximation algorithms for weighted matroid intersection
- Efficient convex optimization with oracles
- Electric routing and concurrent flow cutting
- scientific article; zbMATH DE number 1303591 (Why is no real title available?)
- scientific article; zbMATH DE number 1559539 (Why is no real title available?)
- Approximate undirected maximum flows in \(O(m\operatorname{polylog}(n))\) time
- Generalized preconditioning and undirected minimum-cost flow
- Localization of electrical flows
- The approximate duality gap technique: a unified theory of first-order methods
- Linear coupling: an ultimate unification of gradient and mirror descent
- Lower bounds for parallel and randomized convex optimization
- Area-convexity, _ regularization, and undirected multicommodity flow
- Accelerated extra-gradient descent: a novel accelerated first-order method
- Unit Capacity Maxflow in Almost $m^{4/3}$ Time
- The power of vertex sparsifiers in dynamic graph algorithms
- Fast augmenting paths by random sampling from residual graphs
- An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations
- Faster approximate multicommodity flow using quadratically coupled flows
- Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs
- Electric routing and concurrent flow cutting
- Approximate maximum flow on separable undirected graphs
- Generalized momentum-based methods: a Hamiltonian perspective
- Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
- Resistance distances in directed graphs: definitions, properties, and applications
- Spectral sparsification via bounded-independence sampling
- Electrical flows for polylogarithmic competitive oblivious routing
- Small-space spectral sparsification via bounded-independence sampling
This page was built for publication: A new approach to computing maximum flows using electrical flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495846)
