92 search results - page 4 / 19 » Bottleneck Domination and Bottleneck Independent Domination ... |
SIAMCOMP
1998
13 years 9 months ago
1998
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
ICCS
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. For many applications, cache misses are the primary performance bottleneck. Even though much research has been performed on automatically optimizing cache behavior at the...
TAMC
2009
Springer
14 years 4 months ago
2009
Springer
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set pr...
ICDCS
2008
IEEE
14 years 4 months ago
2008
IEEE
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
DC
2010
13 years 10 months ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...