Minimum cuts in parametric networks
From MaRDI portal
Recommendations
- Parametric min-cuts analysis in a network.
- Structural and algorithmic properties for parametric minimum cuts
- A fast algorithm for the generalized parametric minimum cut problem and applications
- Parametric analysis of overall min-cuts and applications in undirected networks.
- Parametric max flow problems in a class of networks with series-parallel structure
Cites work
Cited in
(17)- Minimal graph cuts on network subgraphs
- Structural and algorithmic properties for parametric minimum cuts
- Faster algorithms for next breakpoint and max value for parametric global minimum cuts
- Minimum cut problem using bases of extended polymatroids
- A faster parametric minimum-cut algorithm
- Parametric analysis of overall min-cuts and applications in undirected networks.
- Computing maximum mean cuts
- Revisiting parametric multi-terminal problems: maximum flows, minimum cuts and cut-tree computations
- Finding the foremost ares in a network with parametric are capacities
- All-Pairs Min-Cut in Sparse Networks
- A sequential algorithm for finding the solution of the parametric minimum flow problem
- Parametric min-cuts analysis in a network.
- A fast algorithm for the generalized parametric minimum cut problem and applications
- A note on the parametric maximum flow problem and some related reoptimization issues
- Enumerating parametric global minimum cuts by random interleaving
- Canceling most helpful total cuts for minimum cost network flow
- Fully-dynamic min-cut
This page was built for publication: Minimum cuts in parametric networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1905228)
