Decentralized maximum-flow protocols

DOI10.1002/net.3230120302zbMath0489.90042OpenAlexW2170720733MaRDI QIDQ3951886

Adrian Segall

Publication date: 1982

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230120302

zbMATH Keywords

algorithmdistributed computationcapacitated networkcontrol messagesmaximum flow in a networkdecentralized regulation of flownodes with memory

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)

Related Items (4)

A principle for sequential reasoning about distributed algorithms ⋮ A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks ⋮ Inefficiencies in network models: a graph-theoretic perspective ⋮ Near-Optimal Distributed Maximum Flow

Cites Work

• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Decentralized information and control: A network flow example

This page was built for publication: Decentralized maximum-flow protocols