A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks
From MaRDI portal
Publication:1673339
DOI10.1016/j.physa.2013.07.078zbMath1395.90035OpenAlexW1980051210MaRDI QIDQ1673339
Saleh Al-Takrouri, Savkin, Andrey V.
Publication date: 11 September 2018
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2013.07.078
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Decentralized systems (93A14) Randomized algorithms (68W20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Qualitative theory of hybrid dynamical systems.
- A data structure for dynamic trees
- Polynomial convergence rates of Markov chains
- Cyclic linear differential automata: A simple class of hybrid dynamical systems
- Globally periodic behavior of switched flow networks with a cyclic switching policy
- Beyond the flow decomposition barrier
- Maximal Flow Through a Network
- Finding Minimum-Cost Circulations by Successive Approximation
- The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
- An O ( n log n ) algorithm for maximum st -flow in a directed planar graph
- Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation
- Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization
- An O(n2log n) parallel max-flow algorithm
- Decentralized maximum-flow protocols
- Optimal flows in networks with multiple sources and sinks
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) Time
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
This page was built for publication: A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks
