Parametric analysis of overall min-cuts and applications in undirected networks.

DOI10.1016/S0020-0190(02)00364-2MaRDI QIDQ1853178zbMATH OpenOpenAlexFDO

Authors R. Chandrasekaran, K. P. K. Nair, Y. P. Aneja

Publication date 21 January 2003

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(02)00364-2

zbMATH Keywords

Combinatorial optimizationGraph algorithmsMultiroute flowsOverall min-cutsResidual flows

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)

Recommendations

• Parametric min-cuts analysis in a network.
• Minimum cuts in parametric networks
• Revisiting parametric multi-terminal problems: maximum flows, minimum cuts and cut-tree computations
• A fast algorithm for the generalized parametric minimum cut problem and applications
• A faster parametric minimum-cut algorithm

Cites work

• scientific article; zbMATH DE number 1256704 (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
• A simple min-cut algorithm
• Maximizing residual flow under an arc destruction
• Minimal ratio spanning trees
• Network flows. Theory, algorithms, and applications.
• Parametric min-cuts analysis in a network.

Cited in

(3)

• Minimum cuts in parametric networks
• Parametric min-cuts analysis in a network.
• Revisiting parametric multi-terminal problems: maximum flows, minimum cuts and cut-tree computations

This page was built for publication: Parametric analysis of overall min-cuts and applications in undirected networks.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853178)