3204 search results - page 121 / 641 » The b-chromatic Number of a Graph |
142
click to vote
COLING
2010
15 years 1 months ago
2010
This paper describes the participation of RelaxCor in the Semeval-2010 task number 1: "Coreference Resolution in Multiple Languages". RelaxCor is a constraint-based grap...
162
click to vote
JCT
2010
15 years 4 months ago
2010
The vertex Folkman number F(r, n, m), n < m, is the smallest integer t such that there exists a Km-free graph of order t with the property that every r-coloring of its vertices...
135
click to vote
MP
2010
15 years 4 months ago
2010
Adding cuts based on copositive matrices, we propose to improve Lov´asz’ bound θ on the clique number and its tightening θ introduced by McEliece, Rodemich, Rumsey, and Schri...
111
click to vote
ESA
2007
Springer
16 years 18 days ago
2007
Springer
In this paper we study a game where every player is to choose a vertex (facility) in a given undirected graph. All vertices (customers) are then assigned to closest facilities and...
177
click to vote
GBRPR
2007
Springer
16 years 18 days ago
2007
Springer
We introduce a method for computing homology groups and their generators of a 2D image, using a hierarchical structure i.e. irregular graph pyramid. Starting from an image, a hiera...