Parametric min-cuts analysis in a network.
From MaRDI portal
Recommendations
- Minimum cuts in parametric networks
- Parametric analysis of overall min-cuts and applications in undirected networks.
- Revisiting parametric multi-terminal problems: maximum flows, minimum cuts and cut-tree computations
- Very Simple Methods for All Pairs Network Flow Analysis
- Structural and algorithmic properties for parametric minimum cuts
Cites work
- scientific article; zbMATH DE number 3702681 (Why is no real title available?)
- scientific article; zbMATH DE number 1256704 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- scientific article; zbMATH DE number 961880 (Why is no real title available?)
- A Fast Parametric Maximum Flow Algorithm and Applications
- Bicriteria Transportation Problem
- Maximal expected flow in a network subject to arc failures
- Maximizing residual flow under an arc destruction
- Minimal ratio spanning trees
- Multi-Terminal Network Flows
- Network flows. Theory, algorithms, and applications.
Cited in
(9)- Structural and algorithmic properties for parametric minimum cuts
- Impact of a varying capacity on the all pairs 2-route network flows
- Minimum cuts in parametric networks
- Generalized parametric multi-terminal flows problem.
- Parametric analysis of overall min-cuts and applications in undirected networks.
- Revisiting parametric multi-terminal problems: maximum flows, minimum cuts and cut-tree computations
- Maximum flows in parametric graph templates
- All-pairs min-cut in sparse networks
- Flows over edge-disjoint mixed multipaths and applications
This page was built for publication: Parametric min-cuts analysis in a network.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1811086)
