Computational Comparison of Eight Methods for the Maximum Network Flow Problem

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Computational Comparison of Eight Methods for the Maximum Network Flow Problem

Full text

Pdf (973 KB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 6 , Issue 1 (March 1980) table of contents

Pages: 1 - 16

Year of Publication: 1980

ISSN:0098-3500

Author

To-Yat Cheung

Department of Computer Science, University of Ottawa, Ottawa, Ontano, Canada

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 24, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/355873.355874 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Alfred V. Aho , John E. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1974
	2	G. Bayer, Algorithms: Algorithm 324: Maxflow, Communications of the ACM, v.11 n.2, p.117-118, Feb. 1968 [doi>10.1145/362896.362917]
	3	DINIC, E.A. Algorithm for solution of a problem of maximum flow m a network with power estimation. Soviet Math. Dokl. 11 (1970), 1277-1280.
	4	Jack Edmonds , Richard M. Karp, Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems, Journal of the ACM (JACM), v.19 n.2, p.248-264, April 1972 [doi>10.1145/321694.321699]
	5	EVEN, S. The max flow algorithm of Dlnic and Karzanov, an exposition. Unpub. Rep, Dept. Comptr. Sci., Technion, Haifa, Israel, 1976.
	6	FONO, C.O., AND RAO, M.R. Accelerated labeling algorithms for the maximal flow problem with applications to transportation and assignment problems. Working Paper No 7222, Graduate School of Management, U. of Rochester, Rochester, N.Y, 1972
	7	FORD, L.R., AND FULKERSON, D.R Flows ~n Networks. Princeton University Press, Princeton, N.J, 1962, pp. 17-19.
	8	JOHNSON, E L. Networks and basic solutions. Oper. Res. 14 (1966), 619-623.
	9	KARZANOV, A V Determining the maximal flow in a network by the method of preflows. Sovtet Math. Dokl. 15 (1972), 434-437.
	10	Bharat Kinariwala , A. G. Rao, Flow Switching Approach to the Maximum Flow Problem: I, Journal of the ACM (JACM), v.24 n.4, p.630-645, Oct. 1977 [doi>10.1145/322033.322042]
	11	LIN, P.M., AND LEON, B.J Improving the efficiency of labeling algorithms for maximum flow in networks. Proc IEEE Int. Syrup. on Circuits and Systems, 1974, pp. 162-166.
	12	NIJENHUIS, A, AND WILF, H.S. Combinatorial Algorzthms Academic Press, New York, 1975, pp 148-151
	13	Walter L. Sullins, Certification of algorithm 266 [G5], Communications of the ACM, v.15 n.12, p.1072-1073, Dec. 1972 [doi>10.1145/361598.361906]
	14	V. Srinivasan , G. L. Thompson, Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems, Journal of the ACM (JACM), v.19 n.4, p.712-726, Oct. 1972 [doi>10.1145/321724.321734]
	15	WALSH, T.S Complexitd des algorlthmes de riot Unpub Rep, Universltd Bordeaux I.