1644 search results - page 6 / 329 » Finding Dominators in Practice |
110
click to vote
MOBIHOC
2002
ACM
15 years 9 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
103
click to vote
ALGORITHMICA
2006
14 years 10 months ago
2006
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
COMBINATORICS
2002
14 years 9 months ago
2002
We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm,...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We consider the problem of finding a lowest cost dominating set in a given disk graph containing n disks. The problem has been extensively studied on subclasses of disk graphs, ye...
MANSCI
2010
14 years 8 months ago
2010
The practice of having PhDs employed by the university that trained them, commonly called "academic inbreeding," has long been assumed to have a damaging effect on schol...