Distributed Algorithms for Finding Centers and Medians in Networks

@article{Korach1984DistributedAF,
  title={Distributed Algorithms for Finding Centers and Medians in Networks},
  author={Ephraim Korach and Doron Rotem and Nicola Santoro},
  journal={ACM Trans. Program. Lang. Syst.},
  year={1984},
  volume={6},
  pages={380-401}
}
The problem of determining in a distributed fashion the centers and the medians of a network is considered. Lower bounds on the time needed to solve these problems are proved. Algorithms that achieve those bounds for tree networks are presented; the number of exchanged messages is linear in the number of nodes. These techniques are extended to work on general networks in O(n) time units exchanging O(n.e) messages, where n is the number of nodes and e the number of edges in the network. In… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
SHOWING 1-10 OF 47 CITATIONS, ESTIMATED 46% COVERAGE

103 Citations

0510'84'91'99'07'15
Citations per Year
Semantic Scholar estimates that this publication has 103 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…