Revisiting parametric multi-terminal problems: maximum flows, minimum cuts and cut-tree computations

DOI10.1016/J.DISOPT.2006.05.003MaRDI QIDQ2465934zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 11 January 2008

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2006.05.003

zbMATH Keywords

cut-treesminimum cutsmulti-terminal network flowssensitivity analysis

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Programming involving graphs or networks (90C35)

Recommendations

• Generalized parametric multi-terminal flows problem.
• Parametric min-cuts analysis in a network.
• Parametric analysis of overall min-cuts and applications in undirected networks.
• Minimum cuts in parametric networks
• A note on the parametric maximum flow problem and some related reoptimization issues

Cites work

• Bottlenecks and Edge Connectivity in Unsymmetrical Networks
• Counterexamples for Directed and Node Capacitated Cut-Trees
• Generalized parametric multi-terminal flows problem.
• scientific article; zbMATH DE number 432789 (Why is no real title available?)
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 6472607 (Why is no real title available?)
• Multi-Terminal Network Flows
• Sensitivity Analysis of Multiterminal Flow Networks
• Very Simple Methods for All Pairs Network Flow Analysis

Cited in

(10)

• Parametric min-cuts analysis in a network.
• Parametric analysis of overall min-cuts and applications in undirected networks.
• Parametric analysis on cut-trees and its application on a protein clustering problem
• Multiroute flows: cut-trees and realizability
• Impact of a varying capacity on the all pairs 2-route network flows
• Sensitivity analysis on the all pairs q-route flows in a network
• Sensitive and parametric analysis of the maximum flow in a network
• Sensitivity analysis of 0-1 multiterminal network flows
• Generalized parametric multi-terminal flows problem.
• Some insights on dynamic maintenance of Gomory-Hu tree in cactus graphs and general graphs

This page was built for publication: Revisiting parametric multi-terminal problems: maximum flows, minimum cuts and cut-tree computations

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