4298 search results - page 28 / 860 » Measurable chromatic numbers |
KDD
2012
ACM
11 years 9 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
JGT
2010
13 years 5 months ago
2010
: Let G be a toroidal graph without cycles of a fixed length k, and l(G) the list chromatic number of G. We establish tight upper bounds Contract grant sponsor: RGC; Contract grant...
SIAMDM
2008
13 years 7 months ago
2008
We first show that for any bipartite graph H with at most five vertices, there exists an on-line competitive algorithm for the class of H-free bipartite graphs. We then analyze th...
DAM
2011
13 years 2 months ago
2011
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a graph ...
IMAGING
2004
13 years 8 months ago
2004
There are two widely held theories of color constancy based on very different mechanisms: Chromatic Adaptation and Spatial Comparisons. Chromatic Adaptation is based on the change...