718 search results - page 87 / 144 » Coloring quasi-line graphs |
102
click to vote
PODC
2010
ACM
15 years 3 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
183
click to vote
AUSSOIS
2001
Springer
15 years 4 months ago
2001
Springer
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...
102
click to vote
DAM
2007
14 years 12 months ago
2007
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...
ICIP
2006
IEEE
16 years 1 months ago
2006
IEEE
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...
106
click to vote
SEMWEB
2009
Springer
15 years 6 months ago
2009
Springer
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...