Probabilistic Analysis of Network Flow Algorithms
From MaRDI portal
Recommendations
- A Randomized Maximum-Flow Algorithm
- An o(n^3 )-Time Maximum-Flow Algorithm
- Probabilistic Analysis of the Capacitated Transportation Problem
- An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs
- Fast approximation algorithms for multicommodity flow problems
Cited in
(15)- Probabilistic Analysis of Geometric Location Problems
- Network efficiency and vulnerability analysis using the flow‐weighted efficiency measure
- Probabilistic analysis of a network design problem heuristic
- Maximum likelihood analysis of the Ford-Fulkerson method on special graphs
- Calculation of traffic flow breakdown probability to optimize link throughput
- scientific article; zbMATH DE number 3904300 (Why is no real title available?)
- A Fast Algorithm for Finding Strong Starters
- Analysis of the random flow generated by the feedback transport protocol in a data transfer network
- Algorithm for computing transition probability between components in Internetware
- Theoretical Investigation of Aggregation in Pseudo-polynomial Network-Flow Models
- Generating pseudo-random permutations and maximum flow algorithms
- scientific article; zbMATH DE number 795219 (Why is no real title available?)
- Probability Characteristic Algorithm of Upstream Traffic in Passive Optical Network
- Algebraic methods for stochastic minimum cut and maximum flow problems
- Probabilistic Analysis of the Capacitated Transportation Problem
This page was built for publication: Probabilistic Analysis of Network Flow Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4697084)
