Sciweavers

836 search results - page 102 / 168
» Orthogonal Colorings of Graphs
Sort
View
AUSSOIS
2001
Springer
15 years 6 months 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»
15 years 1 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
16 years 3 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
15 years 8 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...
ICIP
2009
IEEE
14 years 11 months ago
A hierarchical graph-based markovian clustering approach for the unsupervised segmentation of textured color images
In this paper, a new unsupervised hierarchical approach to textured color images segmentation is proposed. To this end, we have designed a two-step procedure based on a grey-scale...
Rachid Hedjam, Max Mignotte