Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation

DOI10.1109/TSE.1983.234958zbMath0513.68066OpenAlexW2007113317MaRDI QIDQ3659168

To-yat Cheung

Publication date: 1983

Published in: IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tse.1983.234958

zbMATH Keywords

distributed graph algorithmsdistributed computationgraph traversal techniquesmaximum network flow problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10)

Related Items (14)

On the impact of sense of direction on message complexity ⋮ An efficient distributed bridge-finding algorithm ⋮ Distributed algorithms for depth-first search ⋮ A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks ⋮ A note on the message complexity of Cidon's distributed depth-first search algorithm ⋮ Nogood-based asynchronous forward checking algorithms ⋮ Distributed processing of graphs: Fundamental cycles algorithm ⋮ Two distributed problems involving Byzantine processes ⋮ On the message complexity of distributed problems ⋮ Algorithms for some graph problems on a distributed computational model ⋮ Some remarks on distributed depth-first search. ⋮ A new distributed depth-first-search algorithm ⋮ Self-stabilizing depth-first search ⋮ Sense of direction in distributed computing

This page was built for publication: Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation