3008 search results - page 102 / 602 » Independence in connected graphs |
131
click to vote
DBA
2004
15 years 7 months ago
2004
This paper discusses how to extend the applicability of the recursive cascade update command of the Xplain query language. This command guarantees termination because cycle detect...
183
click to vote
ISBI
2011
IEEE
14 years 10 months ago
2011
IEEE
The tensor-based morphometry (TBM) has been widely used in characterizing tissue volume difference between populations at voxel level. We present a novel computational framework f...
155
click to vote
AINA
2010
IEEE
15 years 11 months ago
2010
IEEE
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
268
click to vote
GC
2011
Springer
15 years 1 months ago
2011
Springer
The Ramsey number r(H, Kn) is the smallest positive integer N such that every graph of order N contains either a copy of H or an independent set of size n. The Tur´an number ex(m,...
213
click to vote
FCS
2009
15 years 4 months ago
2009
A set S V is a dominating set of a graph G = (V; E) if each vertex in V is either in S or is adjacent to a vertex in S. A vertex is said to dominate itself and all its neighbors. ...