๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Processor-efficient implementation of a maximum flow algorithm

โœ Scribed by Andrew V. Goldberg

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
983 KB
Volume
38
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Parallel Implementation of the Push-Re
A Parallel Implementation of the Push-Relabel Algorithm for the Maximum Flow Problem
โœ R. Anderson; J.C. Setubal ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1002 KB

We describe an efficient parallel implementation of the pushrelabel maximum flow algorithm for a shared-memory multiprocessor. Our main technical innovation is a method that allows the "global relabeling" heuristic to be executed concurrently with the main algorithm; this heuristic is essential for

Efficient Implementation of Image Warpin
Efficient Implementation of Image Warping on a Multimedia Processor
โœ O.D. Evans; Y. Kim ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 114 KB

he spatial transformation of images, commonly known as image warping, is fundamental to many applications, e.g. remote sensing, medical imaging, computer vision, and computer Tgr aphics. Computational demands in image warping are high, requiring a geometric transformation, address and coefficient ge

A Faster Deterministic Maximum Flow Algo
A Faster Deterministic Maximum Flow Algorithm
โœ V. King; S. Rao; R. Tarjan ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1011 KB

Cheriyan and Hagerup developed a randomized algorithm to compute the maximum flow in a graph with \(n\) nodes and \(m\) edges in \(O\left(m n+n^{2} \log ^{2} n\right)\) expected time. The randomization is used to efficiently play a certain combinatorial game that arises during the computation. We gi