论文信息 - Generalized Parametric Multi-terminal Flows Problem

Generalized Parametric Multi-terminal Flows Problem

Given an undirected edge-weighted n-nodes network in which a single edge-capacity is allowed to vary, Elmaghraby studied the sensitivity analysis of the multi-terminal network flows. The procedure he proposed requires the computation of as many Gomory-Hu cut trees as the number of critical capacities of the edge, leading to a pseudo-polynomial algorithm.

[1] Andrew V. Goldberg,et al. Experimental study of minimum cut algorithms , 1997, SODA '97.

[2] Salah E. Elmaghraby,et al. On the relationship between the cut-tree and the fundamental cut set of multi-terminal flow networks , 1964 .

[3] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.

[4] T. C. Hu,et al. Combinatorial algorithms , 1982 .

[5] D. R. Fulkerson,et al. Flows in Networks. , 1964 .

[6] T. C. Hu,et al. Multi-Terminal Network Flows , 1961 .

[7] Dan Gusfield,et al. Very Simple Methods for All Pairs Network Flow Analysis , 1990, SIAM J. Comput..