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

DOI10.1016/S0020-0190(02)00364-2zbMath1042.68002OpenAlexW2076192504MaRDI QIDQ1853178

R. Chandrasekaran, K. P. K. Nair, Yash 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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parametric min-cuts analysis in a network.
• Minimal ratio spanning trees
• A simple min-cut algorithm
• Maximizing residual flow under an arc destruction
• A Fast Parametric Maximum Flow Algorithm and Applications

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