Sciweavers

751 search results - page 38 / 151
» The Distinguishing Chromatic Number
Sort
View
JVCIR
2007
125views more  JVCIR 2007»
14 years 11 months ago
Displaying colourimetrically calibrated images on a high dynamic range display
When colourimetrically characterising a high dynamic range display (HDR) built from an LCD panel and an LED backlight one is faced with several problems: the channels may not be c...
Alexa I. Ruppertsberg, Marina Bloj, Francesco Bant...
COMBINATORICS
2007
77views more  COMBINATORICS 2007»
14 years 11 months ago
Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,...
Manuel Bodirsky, Éric Fusy, Mihyun Kang, St...
CIAC
2010
Springer
262views Algorithms» more  CIAC 2010»
15 years 2 months ago
Graph unique-maximum and conflict-free colorings
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
Panagiotis Cheilaris and Géza Tóth
JCT
2007
112views more  JCT 2007»
14 years 11 months ago
On generalized Kneser hypergraph colorings
In Ziegler (2002), the second author presented a lower bound for the chromatic numbers of hypergraphs KGr sssS, “generalized r-uniform Kneser hypergraphs with intersection multi...
Carsten E. M. C. Lange, Günter M. Ziegler
78
Voted
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
15 years 11 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani