A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks
type: Item
instance of: scholarly article
title: A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks
zbMATH Open document ID: 1395.90035
author: Saleh Al-Takrouri
author: A. V. Savkin
published in: Physica A
publication date: 2018-09-11T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 05C82
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 93A14
zbMATH DE Number: 6935384
zbMATH Keywords: complex networks
zbMATH Keywords: cascaded failure
zbMATH Keywords: maximum flow
zbMATH Keywords: distributed algorithms
zbMATH Keywords: randomized algorithms
MaRDI profile type: Publication
full work available at URL: j.physa.2013.07.078
OpenAlex ID: W1980051210
cites work: Maximal Flow Through a Network
cites work: Q5624995
cites work: Q4058442
cites work: A data structure for dynamic trees
cites work: Finding Minimum-Cost Circulations by Successive Approximation
cites work: Beyond the flow decomposition barrier
cites work: The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
cites work: An O ( n log n ) algorithm for maximum st -flow in a directed planar graph
cites work: Q3056948
cites work: Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
cites work: Decentralized maximum-flow protocols
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation
cites work: Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization
cites work: An O(n2log n) parallel max-flow algorithm
cites work: Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) Time
cites work: Qualitative theory of hybrid dynamical systems.
cites work: Globally periodic behavior of switched flow networks with a cyclic switching policy
cites work: Cyclic linear differential automata: A simple class of hybrid dynamical systems
cites work: Polynomial convergence rates of Markov chains
cites work: Optimal flows in networks with multiple sources and sinks
cites work: Coordination of groups of mobile autonomous agents using nearest neighbor rules
DOI: 10.1016/J.PHYSA.2013.07.078
description: scientific article; zbMATH DE number 6935384