Deterministic maximum flows in simple graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1559539 (Why is no real title available?)
- scientific article; zbMATH DE number 1775390 (Why is no real title available?)
- scientific article; zbMATH DE number 3349645 (Why is no real title available?)
- scientific article; zbMATH DE number 7788485 (Why is no real title available?)
- A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and beyond
- A new approach to the maximum-flow problem
- Beyond the flow decomposition barrier
- Breaking the \(O(n^{2.5})\) deterministic time barrier for undirected unit-capacity maximum flow
- Computing maximum flow with augmenting electrical flows
- Faster Fully-Dynamic Minimum Spanning Forest
- Faster energy maximization for faster maximum flow
- Navigating central path with electrical flows: from flows to matchings, and back
- Path finding methods for linear programming: solving linear programs in \(\widetilde{O}(\sqrt{rank})\) iterations and faster algorithms for maximum flow
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Random sampling in residual graphs
This page was built for publication: Deterministic maximum flows in simple graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241214)
