836 search results - page 49 / 168 » Orthogonal Colorings of Graphs |
101
Voted
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
Given a vector ( 1 2 ::: t) of non increasing positive integers, and an undirected graph G = (V E), an L( 1 2 ::: t)-coloring of G is a function f from the vertex set V to a set o...
107
Voted
COMBINATORICS
2006
15 years 1 months ago
2006
We prove several results regarding edge-colored complete graphs and rainbow cycles, cycles with no color appearing on more than one edge. We settle a question posed by Ball, Pultr...
113
click to vote
GC
2007
Springer
15 years 1 months ago
2007
Springer
Let Qn be a hypercube of dimension n, that is, a graph whose vertices are binary n-tuples and two vertices are adjacent iff the corresponding n-tuples differ in exactly one posit...
137
click to vote
CVIU
2008
15 years 2 months ago
2008
We present a new noise model for color channels for statistical change detection. Based on this noise modeling, we estimate the distribution of Euclidean distances between the pix...
89
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM