Bounds on maximum concurrent flow in random bipartite graphs
From MaRDI portal
Recommendations
- Fast Algorithms for Bipartite Network Flow
- scientific article; zbMATH DE number 3914356
- Sparsest cuts and bottlenecks in graphs
- Randomized approximation schemes for cuts and flows in capacitated graphs
- An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs
Cites work
- A combinatorial approximation algorithm for concurrent flow problem and its application
- A Theorem on Boolean Matrices
- An O( n)-approximation algorithm for directed sparsest cut
- Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem
- Diameters of random bipartite graphs
- Efficient algorithms for the maximum concurrent flow problem
- Expander flows, geometric embeddings and graph partitioning
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 3898784 (Why is no real title available?)
- Linear time algorithms for finding sparsest cuts in various graph classes
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- Polynomial flow-cut gaps and hardness of directed cut problems
- Sparsest cuts and bottlenecks in graphs
- The maximum concurrent flow problem
Cited in
(2)
This page was built for publication: Bounds on maximum concurrent flow in random bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2228396)
