Flow Switching Approach to the Maximum Flow Problem: I

DOI10.1145/322033.322042zbMath0413.90077OpenAlexW1985401703MaRDI QIDQ3048614

Bharat Kinariwala, Ambar G. Rao

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

zbMATH Keywords

network programmingmaximum flowdirected pathnetwork flow algorithmsflow switching

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Paths and cycles (05C38)

Related Items (3)

Numerical investigations on the maximal flow algorithm of Karzanov ⋮ Decomposition algorithms for minimal cut problems ⋮ Decomposition algorithms for locating minimal cuts in a network

This page was built for publication: Flow Switching Approach to the Maximum Flow Problem: I