109 search results - page 5 / 22 » Large independent sets in regular graphs of large girth |
153
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
154
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Let G = (V, E) be a graph. Let c : V → N be a vertex-coloring of the vertices of G. For any vertex u, we denote by N[u] its closed neighborhood (u and its adjacent vertices), an...
172
click to vote
INFOCOM
2008
IEEE
16 years 14 days ago
2008
IEEE
Abstract—Recent advances in computer technology and wireless communications have enabled the emergence of stream-based sensor networks. In such sensor networks, real-time data ar...
197
click to vote
COMBINATORICA
2010
15 years 3 months ago
2010
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
160
click to vote
ICML
2009
IEEE
16 years 6 months ago
2009
IEEE
Practical data mining rarely falls exactly into the supervised learning scenario. Rather, the growing amount of unlabeled data poses a big challenge to large-scale semi-supervised...