Distributed computation on graphs

DOI10.1145/358690.358717zbMath0491.68064OpenAlexW2097740541MaRDI QIDQ3953185

K. Mani Chandy, Jayadev Misra

Publication date: 1982

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/358690.358717

zbMATH Keywords

depth first searchnegative cyclediffusing computation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Algorithms in computer science (68W99)

Related Items (16)

A distributed algorithm for distributed termination ⋮ Shortest hop multipath algorithm for wireless sensor networks ⋮ Parallel simulation on the hypercube multiprocessor ⋮ A new optimal distributed algorithm for the set intersection problem ⋮ Performance evaluation of fault-tolerant routing algorithms: an optimization problem ⋮ Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks ⋮ How to improve snap-stabilizing point-to-point communication space complexity? ⋮ The distributed simulation of clustered processes ⋮ MINIMUM ENERGY BROADCAST ROUTING IN AD HOC AND SENSOR NETWORKS WITH DIRECTIONAL ANTENNAS ⋮ Further contributions to network optimization ⋮ TIGHT ANALYSIS OF SHORTEST PATH CONVERGECAST IN WIRELESS SENSOR NETWORKS ⋮ Searching for spreads and packings ⋮ The lower bounds on distributed shortest paths ⋮ An optimal distributed algorithm for recognizing mesh-connected networks ⋮ A comprehensive simplex-like algorithm for network optimization and perturbation analysis ⋮ On distributed search

This page was built for publication: Distributed computation on graphs