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

A self-stabilizing algorithm for the maximum flow problem

โœ Scribed by Sukumar Ghosh; Arobinda Gupta; Sriram V. Pemmaraju

Publisher
Springer-Verlag
Year
1997
Tongue
English
Weight
609 KB
Volume
10
Category
Article
ISSN
0178-2770

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A capacity scaling algorithm for the con
A capacity scaling algorithm for the constrained maximum flow problem
โœ Ravindra K. Ahuja; James B. Orlin ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 970 KB

## Abstract The constrained maximum flow problem is to send the maximum possible flow from a source node s to a sink node t in a directed network subject to a budget constraint that the cost of flow is no more than __D__. In this paper, we consider two versions of this problem: (i) when the cost of

A self-stabilizing algorithm for the sho
A self-stabilizing algorithm for the shortest path problem in a distributed system
โœ Tetz C. Huang; Ji-Cherng Lin ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 352 KB

In this paper, we propose a self-stabilizing algorithm for finding shortest paths in a distributed system in which a central daemon is assumed. The correctness of the proposed algorithm is proved by using the bounded function technique.

A self-stabilizing algorithm for the sho
A self-stabilizing algorithm for the shortest path problem assuming the distributed demon
โœ Tetz C. Huang ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1015 KB

Shortest path finding has a variety of applications in transportation and communication. In this paper, we study a well-known self-stabilizing algorithm for the shortest path problem for the distributed systems. The prevlotm works on this topic had two assumptions that can be relaxed in this paper.