MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Fast Distributed Construction of Small k-Dominating Sets and Applications (2000) [26 citations — 3 self]

by Shay Kutten ,  David Peleg
Add To MetaCart

Abstract:

This paper presents a fast distributed algorithm to compute a small k-dominating set D (for any xed k) and its induced graph partition (breaking the graph into radius k clusters centered around the vertices of D). The time complexity of the algorithm is O(k log n).

Citations

503 Data Structures and Network Algorithms – Tarjan - 1974
251 A distributed algorithm for minimum weight spanning trees – Gallager, Humblet, et al. - 1983
176 Complexity of Network Synchronization – Awerbuch - 1985
62 Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems – Awerbuch - 1987
60 Network decomposition and locality in distributed computation – Awerbuch, Goldberg, et al. - 1989
55 Time optimal selfstabilizing synchronization – Awerbuch, Kutten, et al. - 1993
53 Time optimal self-stabilizing spanning tree algorithms – Aggarwal - 1994
40 A sub-linear time distributed algorithm for minimum-weight spanning trees – Garay, Kutten, et al. - 1998
39 On the ratio of optimal integral and fractional covers. Discrete Mathematics 13 – Lovász - 1975
29 The k-domination and k-stability problems on sun-free chordal graphs – Chang, Nemhauser - 1984
29 Improved Distributed Algorithms for Coloring and Network Decomposition problems – Panconesi, Srinivasan - 1992
21 Time and message bounds for election in synchronous and asynchronous complete networks – Afek, Gafni - 1991
20 Parallel symmetry breaking in sparse graphs – Goldberg, Plotkin, et al. - 1987
19 Improvements in the time complexity of two message-optimal election algorithms – Gafni - 1985
17 Time-optimal leader election in general networks – Peleg - 1990
13 Distributive Graph Algorithms - Global Solutions from Local Data – Linial - 1987
10 Distributed data structures: a complexity oriented view – Peleg - 1990
5 A trade-o# between size and e#ciency for routing tables – Peleg, Upfal
4 An upper bound for the k-domination number of a graph – Cockayne, Gamble, et al. - 1985
3 Connected components in O(lg 3=2 jV j) parallel time for the CREW PRAM – Johnson, Metaxas - 1991
2 An Almost Linear Time and O(n log(n) + e) Messages Distributed Algorithm for Minimum-Weight Spanning Trees – Chin, Ting - 1985
1 How to Allocate Network – Bar-Ilan, Kortsarz, et al. - 1993
View or Download | Add to My Collection | Correct Errors