1302 search results - page 64 / 261 » On the Strong Chromatic Number |
211
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
190
click to vote
APPROX
2011
Springer
14 years 6 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
222
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
154
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
162
click to vote
JC
2008
15 years 6 months ago
2008
We study multivariate approximation for continuous functions in the average case setting. The space of d variate continuous functions is equipped with the zero mean Gaussian measu...