Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows

Full text

Pdf (487 KB)

Source

Journal of the ACM (JACM) archive
Volume 19 , Issue 1 (January 1972) table of contents

Pages: 184 - 192

Year of Publication: 1972

ISSN:0004-5411

Author

Norman Zadeh

Operations Research Center, University of California, Berkeley, California

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 12, Downloads (12 Months): 82, Citation Count: 3

Additional Information:

references cited by index terms

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/321679.321693 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	EDMONDS, J., AND KARP, R.M. Theoretical improvements in algorithmic emciency for network flow problems. Operations Research Center Report ORC 70-24, U. of California, Berkeley (July 1970), pp. 1-9 (to appear in J. ACM).
	2	Hu, T. C. Integer Programming and Network Flows. Addison-Wesley, Reading, Mass., 1969.

CITED BY 3

	Alon Itai, Two-Commodity Flow, Journal of the ACM (JACM), v.25 n.4, p.596-611, Oct. 1978
	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
	R. Endre Tarjan, Testing graph connectivity, Proceedings of the sixth annual ACM symposium on Theory of computing, p.185-193, April 30-May 02, 1974, Seattle, Washington, United States