|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'501'711
Articles rated: 2609
20 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
A distributed algorithm to find k-dominating sets | | L. D. Penso
; V. C. Barbosa
; | | Date: |
23 Sep 2003 | | Journal: | Discrete Applied Mathematics 141 (2004), 243-253 | | Subject: | Distributed, Parallel, and Cluster Computing ACM-class: F.1.2; F.2.2 | cs.DC | | Abstract: | We consider a connected undirected graph $G(n,m)$ with $n$ nodes and $m$ edges. A $k$-dominating set $D$ in $G$ is a set of nodes having the property that every node in $G$ is at most $k$ edges away from at least one node in $D$. Finding a $k$-dominating set of minimum size is NP-hard. We give a new synchronous distributed algorithm to find a $k$-dominating set in $G$ of size no greater than $lfloor n/(k+1)
floor$. Our algorithm requires $O(klog^*n)$ time and $O(mlog k+nlog klog^*n)$ messages to run. It has the same time complexity as the best currently known algorithm, but improves on that algorithm’s message complexity and is, in addition, conceptually simpler. | | Source: | arXiv, cs.DC/0309040 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER