• Publications
  • Influence
Sensitivity analysis of 0-1 multiterminal network flows
TLDR
Given an undirected 0-1 flow network G with n nodes, Gomory and Hu's algorithm solves the multiterminal maximum flow problem by constructing a cut-tree for G by first transforming the given cut-treasury for G into a marginal cut-Tree and then transforming the marginal Cut-tree into a Cut-Tree for the perturbed network.