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
(20)- A parametric maximum flow algorithm for bipartite graphs with applications
- A fast algorithm for the generalized parametric minimum cut problem and applications
- A faster parametric minimum-cut algorithm
- Computing maximum mean cuts
- Minimum cut problem using bases of extended polymatroids
- Parametric min-cuts analysis in a network.
- Parametric analysis of overall min-cuts and applications in undirected networks.
- Revisiting parametric multi-terminal problems: maximum flows, minimum cuts and cut-tree computations
- A note on the parametric maximum flow problem and some related reoptimization issues
- Complexity of source-sink monotone 2-parameter min cut
- scientific article; zbMATH DE number 4202051 (Why is no real title available?)
- 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
- Faster algorithms for next breakpoint and max value for parametric global minimum cuts
- Canceling most helpful total cuts for minimum cost network flow
- Enumerating parametric global minimum cuts by random interleaving
- Minimal graph cuts on network subgraphs
- Structural and algorithmic properties for parametric minimum cuts
- 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)
