Flow Switching Approach to the Maximum Flow Problem: I
From MaRDI portal
Publication:3048614
DOI10.1145/322033.322042zbMath0413.90077MaRDI QIDQ3048614
Ambar G. Rao, Bharat Kinariwala
Publication date: 1977
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322033.322042
90C35: Programming involving graphs or networks
05C35: Extremal problems in graph theory
65K05: Numerical mathematical programming methods
90B10: Deterministic network models in operations research
05C38: Paths and cycles
Related Items
Numerical investigations on the maximal flow algorithm of Karzanov, Decomposition algorithms for minimal cut problems, Decomposition algorithms for locating minimal cuts in a network