GC
2002
Springer
13 years 5 months ago
2002
Springer
Given a graph on n vertices which is the union of two comparability graphs on the same vertex set, it always contains a clique or independent set of size n 1 3 . On the other hand...
JCT
2007
13 years 5 months ago
2007
Let G be a simple graph with n vertices and m edges. Let ω(G) and α(G) be the numbers of vertices of the largest clique and the largest independent set in G, respectively. In th...
CVPR
2007
IEEE
14 years 7 months ago
2007
IEEE
Belief propagation over pairwise connected Markov Random Fields has become a widely used approach, and has been successfully applied to several important computer vision problems....