A self-stabilizing algorithm for the maximum flow problem
From MaRDI portal
Publication:5137339
DOI10.1007/s004460050034zbMath1448.68470OpenAlexW3161577116MaRDI QIDQ5137339
Sukumar Ghosh, Arobinda Gupta, Sriram V. 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
Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Related Items
A self-stabilizing algorithm for detecting fundamental cycles in a graph, Self-stabilizing local \(k\)-placement of replicas with local minimum variance
Cites Work
- An exercise in fault-containment: Self-stabilizing leader election
- Stabilizing unison
- A self-stabilizing algorithm for constructing spanning trees
- A self-stabilizing algorithm for constructing breadth-first trees
- Self-stabilization of dynamic systems assuming only read/write atomicity
- A self-stabilizing algorithm for coloring planar graphs
- Self-stabilizing depth-first search
- Memory requirements for silent stabilization
- Fault-containing self-stabilizing algorithms
- Maximal Flow Through a Network
- Complexity of network synchronization
- A new approach to the maximum-flow problem
- An O(n2log n) parallel max-flow algorithm
- Self-stabilizing systems in spite of distributed control
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
