1208 search results - page 66 / 242 » On Counting Generalized Colorings |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...
JGT
2008
13 years 9 months ago
2008
The measurable list chromatic number of a graph G is the smallest number such that if each vertex v of G is assigned a set L(v) of measure in a fixed atomless measure space, the...
SIGGRAPH
2000
ACM
14 years 1 months ago
2000
ACM
Adaptively Sampled Distance Fields (ADFs) are a unifying representation of shape that integrate numerous concepts in computer graphics including the representation of geometry and...
NIPS
1996
13 years 10 months ago
1996
In the square linear blind source separation problem, one must nd a linear unmixing operator which can detangle the result xi(t) of mixing n unknown independent sources si(t) thro...
IWPEC
2010
Springer
13 years 7 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...