Multiterminal flows and cuts

Authors:
David Hartvigsen;François Margot
Affiliations:
Department of Management, College of Business Administration, University of Notre Dame, Notre Dame, IN 46556-5641, USA;Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA 15213-3890, USA
Venue:
Operations Research Letters
Year:
1995

Citing 1
Cited 2

Solution bases of multiterminal cut problems

Mathematics of Operations Research

Design theory and implementation for low-power segmented bus systems

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Multiroute flows: Cut-trees and realizability

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Gomory and Hu (1961) studied minimal collections of cuts in a graph that contain a min cut for every pair of a specified set of terminal nodes. In this note we provide a new characterization of these collections of cuts in terms of a generalized notion of a min cut. We then use this new notion of a min cut to formulate a multuterminal generalization of the well-known max flow/min cut theorem for the case of undirected graphs.