Faster algorithms for rooted connectivity in directed graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- scientific article; zbMATH DE number 7788370 (Why is no real title available?)
- A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
- A matroid approach to finding edge connectivity and packing arborescences
- Beyond the flow decomposition barrier
- Breaking quadratic time for small vertex connectivity and an approximation scheme
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Computing Vertex Connectivity: New Bounds from Old Techniques
- Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms
- Computing maximum flow with augmenting electrical flows
- Connections in combinatorial optimization
- Deterministic min-cut in poly-logarithmic max-flows
- Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity
- Faster energy maximization for faster maximum flow
- Finding the edge connectivity of directed graphs
- Max flows in O(nm) time, or better
- Navigating central path with electrical flows: from flows to matchings, and back
- Network Flow and Testing Graph Connectivity
- Path finding methods for linear programming: solving linear programs in \(\widetilde{O}(\sqrt{rank})\) iterations and faster algorithms for maximum flow
- Unit capacity maxflow in almost \(O(m^{4/3})\) time
- Using expander graphs to find vertex connectivity
- Vertex connectivity in poly-logarithmic max-flows
This page was built for publication: Faster algorithms for rooted connectivity in directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241147)
