A self-stabilizing algorithm for the maximum flow problem

DOI10.1007/S004460050034MaRDI QIDQ5137339zbMATH OpenOpenAlexFDO

Authors Sukumar Ghosh, Arobinda Gupta, Sriram Pemmaraju

Publication date 2 December 2020

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s004460050034

zbMATH Keywords

distributed algorithmsfault-tolerancemaximum flowself-stabilization

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Combinatorial optimization (90C27)

Recommendations

• A self-stabilizing algorithm for maximal matching
• Dynamic and self-stabilizing distributed matching
• A dynamic self-stabilizing algorithm for constructing a transport net
• A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2
• A stabilizing algorithm for finding biconnected components

Cites work

• A new approach to the maximum-flow problem
• A self-stabilizing algorithm for coloring planar graphs
• A self-stabilizing algorithm for constructing breadth-first trees
• A self-stabilizing algorithm for constructing spanning trees
• An exercise in fault-containment: Self-stabilizing leader election
• An O(n2log n) parallel max-flow algorithm
• Complexity of network synchronization
• Fault-containing self-stabilizing algorithms
• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• scientific article; zbMATH DE number 47262 (Why is no real title available?)
• scientific article; zbMATH DE number 515922 (Why is no real title available?)
• Introduction to algorithms.
• Maximal Flow Through a Network
• Memory requirements for silent stabilization
• Self-stabilization of dynamic systems assuming only read/write atomicity
• Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
• Self-stabilizing depth-first search
• Self-stabilizing systems in spite of distributed control
• Stabilizing unison
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Cited in

(4)

• A self-stabilizing algorithm for detecting fundamental cycles in a graph
• Self-stabilizing local k-placement of replicas with local minimum variance
• A self-stabilizing algorithm for the st-order problem
• A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks

This page was built for publication: A self-stabilizing algorithm for the maximum flow problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5137339)