51 search results - page 3 / 11 » Constructive Upper Bounds for Cycle-Saturated Graphs of Mini... |
ICDCS
2008
IEEE
13 years 11 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...
TIT
2008
13 years 5 months ago
2008
For a linear code , the stopping redundancy of is defined as the minimum number of check nodes in a Tanner graph T for such that the size of the smallest stopping set in T is equal...
DAM
2006
13 years 5 months ago
2006
To a set of n points in the plane, one can associate a graph that has less than n2 vertices and has the property that k-cliques in the graph correspond vertex sets of convex k-gon...
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
COMBINATORICS
1999
13 years 5 months ago
1999
Let G = (V, E) be an undirected graph. Let C be a subset of vertices that we shall call a code. For any vertex v V , the neighbouring set N(v, C) is the set of vertices of C at d...