Multi-terminal maximum flows in node-capacitated networks (Q1085773)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Multi-terminal maximum flows in node-capacitated networks |
scientific article; zbMATH DE number 3982884
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multi-terminal maximum flows in node-capacitated networks |
scientific article; zbMATH DE number 3982884 |
Statements
Multi-terminal maximum flows in node-capacitated networks (English)
0 references
1986
0 references
The problem of finding the maximum flows between each pair of nodes in a subset of K nodes of a node- and arc-capacitated undirected network is considered. This problem arises in the study of communication and transportation networks. \textit{R. E. Gomory} and \textit{T. C. Hu} [SIAM J. Appl. Math. 9, 551-570 (1961; Zbl 0112.124)] solved the arc-capacited case for this problem. The purpose of this paper is to extend Gomory and Hu's result to the general node- and arc-capacited case.
0 references
multi-terminal maximum flows
0 references
undirected network
0 references
communication and transportation networks
0 references
general node- and arc-capacited case
0 references
0.8219844698905945
0 references
0.8202832341194153
0 references
0.796029269695282
0 references
0.7958788871765137
0 references
