
CDS-based Snapshot and Continuous Data Collection
231
that the radius of G
with respect to s
0
is L
and we denote the union of dominators
at level l (0 ≤ l ≤ L
) as set D
l
. Note that D
0
= {s
0
}. Second, we choose nodes, also
called connectors, to connect all the nodes in D to form a CDS. Let S
l
(0 ≤ l ≤ L
)
be the set of the nodes adjacent to at least one node in D
l
and at least one node in
D
l+1
and compute a minimal cover C
l
⊆S
l
for D
l+1
.LetC =
∪
L
−1
0
C
l
and therefore
D ∪C is a CDS of G. As shown in Figure 10.1(c), the blue nodes {s
1
,s
2
,s
3
} are
connectors chosen to connect the dominators in D
0
= {s
0
} and D
1
= {s
5
,s
7
,s
9
,s
11
}.
Meanwhile, the union of the dominators ...