Advanced Search

Query:

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

Format:

Display: entries per page entries

Zbl 1139.90335
Ciurea, Eleonor; Ciupală, Laura
Sequential and parallel algorithms for minimum flows. (English)
[J] J. Appl. Math. Comput. 15, No. 1-2, 53-75 (2004). ISSN 1598-5865; ISSN 1865-2085/e

Summary: First, we present two classes of sequential algorithms for minimum flow problem: decreasing path algorithms and preflow algorithms. Then we describe another approach of the minimum flow problem, that consists of applying any maximum flow algorithm in a modified network. In section 5 we present several parallel preflow algorithms that solve the minimum flow problem. Finally, we present an application of the minimum flow problem.

MSC 2000:: *90B10 Flows in networks
05C85 Graphic algorithms
68R10 Graph theory in connection with computer science
90C35 Network programming

Keywords: network flow; network algorithms; minimum flow problem; parallel algorithms

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]