Bounds on maximum concurrent flow in random bipartite graphs
From MaRDI portal
Publication:2228396
DOI10.1007/S11590-020-01543-WzbMATH Open1459.90217OpenAlexW3005261803MaRDI QIDQ2228396FDOQ2228396
Authors: Fernando E. Vilas, David W. Matula, Eli V. Olinick 
Publication date: 17 February 2021
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-020-01543-w
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
- Title not available (Why is that?)
- A Theorem on Boolean Matrices
- Expander flows, geometric embeddings and graph partitioning
- The maximum concurrent flow problem
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- Linear time algorithms for finding sparsest cuts in various graph classes
- Sparsest cuts and bottlenecks in graphs
- Polynomial flow-cut gaps and hardness of directed cut problems
- Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem
- Efficient algorithms for the maximum concurrent flow problem
- A combinatorial approximation algorithm for concurrent flow problem and its application
- Diameters of random bipartite graphs
- Title not available (Why is that?)
- An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut
Cited In (2)
Uses Software
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)
