Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 0898.68029
Cherkassky, B.V.; Goldberg, A.V.
On implementing the push-relabel method for the maximum flow problem. (English)
[J] Algorithmica 19, No.4, 390-410 (1997). ISSN 0178-4617; ISSN 1432-0541/e

Summary: We study efficient implementations of the push-relabel method for the maximum flow problem. The resulting codes are faster than the previous codes, and much faster on some problem families. The speedup is due to the combination of heuristics used in our implementations: we show that the highest-level selection strategy gives better results when combined with both global and gap relabeling heuristics. We also exhibit a family of problems for which the running time of all implementations we consider is quadratic.

MSC 2000:: *68W10 Parallel algorithms
68Q60 Specification and verification of programs

Keywords: push-relabel method; maximum flow problem

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]