Distributed computation on graphs

DOI10.1145/358690.358717MaRDI QIDQ3953185zbMATH OpenOpenAlexFDO

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

Recommendations

• Distributed distance computation and routing with small messages
• On finding and updating shortest paths distributively
• scientific article; zbMATH DE number 2080918
• scientific article; zbMATH DE number 1810469
• Another adaptive distributed shortest path algorithm

Cited in

(19)

• Parallel simulation on the hypercube multiprocessor
• Shortest hop multipath algorithm for wireless sensor networks
• MINIMUM ENERGY BROADCAST ROUTING IN AD HOC AND SENSOR NETWORKS WITH DIRECTIONAL ANTENNAS
• How to improve snap-stabilizing point-to-point communication space complexity?
• Distributed computing of efficient routing schemes in generalized chordal graphs
• Further contributions to network optimization
• scientific article; zbMATH DE number 2080918 (Why is no real title available?)
• The lower bounds on distributed shortest paths
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis
• An optimal distributed algorithm for recognizing mesh-connected networks
• The distributed simulation of clustered processes
• A new optimal distributed algorithm for the set intersection problem
• Tight analysis of shortest path convergecast in wireless sensor networks
• A distributed algorithm for distributed termination
• On distributed search
• Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks
• Algorithms for some graph problems on a distributed computational model
• Performance evaluation of fault-tolerant routing algorithms: an optimization problem
• Searching for spreads and packings

This page was built for publication: Distributed computation on graphs

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