85 search results - page 3 / 17 » The Expected Size of the Rule k Dominating Set |
COMBINATORICS
2002
13 years 5 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,...
CPC
2006
13 years 5 months ago
2006
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
ADBIS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. The last years there is an increasing interest for query processing techniques that take into consideration the dominance relationship between objects to select the most ...
HICSS
2008
IEEE
13 years 5 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
IPL
2008
13 years 5 months ago
2008
A problem open for many years is whether there is an FPT algorithm that given a graph G and parameter k, either: (1) determines that G has no k-Dominating Set, or (2) produces a do...