Sciweavers

720 search results - page 90 / 144
» Nonrepetitive colorings of graphs
Sort
View
AUSSOIS
2001
Springer
14 years 4 days ago
Exact Algorithms for NP-Hard Problems: A Survey
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open prob...
Gerhard J. Woeginger
DAM
2007
141views more  DAM 2007»
13 years 7 months ago
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several...
Bostjan Bresar, Sandi Klavzar, Douglas F. Rall
ICIP
2006
IEEE
14 years 9 months ago
Generation of Long-Term Color and Motion Coherent Partitions
This paper describes a technique for generating partition sequences of regions presenting long-term homogeneity in color and motion coherency in terms of affine models. The techni...
Camilo C. Dorea, Ferran Marqués, Montse Par...
SEMWEB
2009
Springer
14 years 2 months ago
Coloring RDF Triples to Capture Provenance
Abstract. Recently, the W3C Linking Open Data effort has boosted the publication and inter-linkage of large amounts of RDF datasets on the Semantic Web. Various ontologies and know...
Giorgos Flouris, Irini Fundulaki, Panagiotis Pedia...
CVPR
2003
IEEE
14 years 9 months ago
Stereo Matching with Reflections and Translucency
In this paper, we address the stereo matching problem in the presence of reflections and translucency, where image formation can be modeled as the additive superposition of layers...
Yanghai Tsin, Sing Bing Kang, Richard Szeliski