803 search results - page 32 / 161 » Independence in Direct-Product Graphs |
AINA
2010
IEEE
14 years 5 days 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...
GC
2011
Springer
13 years 2 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,...
FCS
2009
13 years 5 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. ...
APPROX
2005
Springer
14 years 29 days ago
2005
Springer
Constructions of k-wise almost independent permutations have been receiving a growing amount of attention in recent years. However, unlike the case of k-wise independent functions...
WABI
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Protein structural alignment is an indispensable tool used for many different studies in bioinformatics. Most structural alignment algorithms assume that the structural ...