Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation

DOI10.1109/TSE.1983.234958MaRDI QIDQ3659168zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(15)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3659168)