Distributed algorithms for finding centers and medians in networks

DOI10.1145/579.585zbMath0543.68051OpenAlexW2029934607MaRDI QIDQ3332262

Ephraim Korach, Doron Rotem, Nicola Santoro

Publication date: 1984

Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

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

zbMATH Keywords

distributed algorithmslocal informationmedian findingcenter findingcomputer-communication networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15) Theory of operating systems (68N25) Software, source code, etc. for problems pertaining to computer science (68-04)

Related Items (15)

Distributed finite-time calculation of node eccentricities, graph radius and graph diameter ⋮ An efficient distributed bridge-finding algorithm ⋮ FINDING CENTERS AND MEDIANS OF GRAPHS IN PARALLEL ⋮ Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees ⋮ A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives ⋮ Distributed processing of graphs: Fundamental cycles algorithm ⋮ An optimal parallel algorithm for computing furthest neighbors in a tree ⋮ On the message complexity of distributed problems ⋮ Statuses and double branch weights of quadrangular outerplanar graphs ⋮ An efficient distributed algorithm for finding all hinge vertices in networks ⋮ Exact communication costs for consensus and leader in a tree ⋮ An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs ⋮ The impact of the apex node on routing inside a pyramid structure ⋮ An optimal distributed algorithm for recognizing mesh-connected networks ⋮ A linear-time algorithm for solving the center problem on weighted cactus graphs

This page was built for publication: Distributed algorithms for finding centers and medians in networks