NDLI: A self-stabilizing algorithm for the maximum flow problem

Content Provider	IEEE Xplore Digital Library
Author	Ghosh, S. Gupta, A. Pemmaraju, S.V.
Copyright Year	1995
Description	Author affiliation: Dept. of Comput. Sci., Iowa Univ., Iowa City, IA, USA (Ghosh, S.; Gupta, A.; Pemmaraju, S.V.)
Abstract	The maximum flow problem is a fundamental problem in graph theory and combinatorial optimization with a variety of important applications. Known distributed algorithms for this problem do not tolerate faults or adjust to dynamic changes in network topology. This paper presents the first distributed self-stabilizing algorithm for the maximum flow problem. Starting from an arbitrary state, the algorithm computes the maximum flow in a acyclic network in finitely many steps. Since the algorithm is self-stabilizing, it is inherently tolerant to transient faults and can automatically adjust to topology changes and to changes in other parameters of the problem. A slight modification of the original algorithm is also presented and it is conjectured that the new algorithm computes a maximum flow in arbitrary networks.<>
Starting Page	8
Ending Page	14
File Size	774656
Page Count	7
File Format	PDF
ISBN	0780324927
DOI	10.1109/PCCC.1995.472519
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1995-03-28
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Network topology Graph theory Computer networks Distributed algorithms Computer science Cities and towns Application software Fault tolerance Computational modeling
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A self-stabilizing algorithm for finding cliques in distributed systems

A self-stabilizing algorithm for the distributed minimal k-redundant dominating set problem in tree networks

Self-stabilizing distributed algorithms for graph alliances

Stabilizing maximum matching in bipartite networks

Distributed Self-Stabilizing Algorithm for Minimum Spanning Tree Construction (1997)

A Self-Stabilizing Distributed Approximation Algorithm for the Minimum Connected Dominating Set

An Incremental Algorithm for the Maximum Flow Problem. Journal of Mathematical Modelling and Algorithms

Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation

Derivation of Fault Tolerance Measures of Self-Stabilizing Algorithms by Simulation

A self-stabilizing algorithm for the maximum flow problem

Similar Documents

A self-stabilizing algorithm for finding cliques in distributed systems

A self-stabilizing algorithm for the distributed minimal k-redundant dominating set problem in tree networks

Self-stabilizing distributed algorithms for graph alliances

Stabilizing maximum matching in bipartite networks

Distributed Self-Stabilizing Algorithm for Minimum Spanning Tree Construction (1997)

A Self-Stabilizing Distributed Approximation Algorithm for the Minimum Connected Dominating Set

An Incremental Algorithm for the Maximum Flow Problem. Journal of Mathematical Modelling and Algorithms

Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation

Derivation of Fault Tolerance Measures of Self-Stabilizing Algorithms by Simulation

A self-stabilizing algorithm for the maximum flow problem