Multiterminal flows and cuts
type: Item
instance of: scholarly article
title: Multiterminal flows and cuts
zbMATH Open document ID: 0858.90051
DOI: 10.1016/0167-6377(95)00018-F
published in: Operations Research Letters
publication date: 1996-10-20T00:00:00Z
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 937077
zbMATH Keywords: minimal collections of cuts in a graph
zbMATH Keywords: max flow/min cut theorem
zbMATH Keywords: undirected graphs
author: David Hartvigsen
author: François Margot
MaRDI profile type: Publication
cites work: Optimal Linear Ordering
cites work: Q4124571
cites work: Maximal Flow Through a Network
cites work: Multi-Terminal Network Flows
cites work: Solution Bases of Multiterminal Cut Problems
cites work: Q5595961
cites work: On some connectivity properties of Eulerian graphs
Recommended article: Crossing properties of multiterminal cuts
Recommended article: Q5417700
Recommended article: Flow-cut gaps for integer and fractional multiflows
Recommended article: Multicuts and integral multiflows in rings
Recommended article: The Complexity of Multiterminal Cuts
Recommended article: A generalized cut-condition for multiflows in matroids
Recommended article: Multiroute flows: cut-trees and realizability
Recommended article: Length-Bounded Cuts and Flows
Recommended article: Length-bounded cuts and flows
Recommended article: Algorithms for Multiterminal Cuts
description: scientific article; zbMATH DE number 937077