406 search results - page 22 / 82 » Dominating Sets in Web Graphs |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
In an undirected graph G = (V, E), a subset C V such that C is a dominating set of G, and each vertex in V is dominated by a distinct subset of vertices from C, is called an iden...
FSTTCS
2009
Springer
14 years 3 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
ARSCOM
2004
13 years 8 months ago
2004
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...
DM
2007
13 years 9 months ago
2007
We consider a variety of connections between threshold graphs, shifted complexes, and simplicial complexes naturally formed from a graph. These graphical complexes include the inde...
MOBIHOC
2008
ACM
14 years 8 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...