762 search results - page 35 / 153 » Strategic Coloring of a Graph |
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
We study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertic...
ALGORITHMICA
2010
14 years 9 months ago
2010
We consider a graph with n vertices, and p < n pebbles of m colors. A pebble move consists of transferring a pebble from its current host vertex to an adjacent unoccupied verte...
ISM
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper we present a robust and novel strategic invisible approach for insertion-extraction of a digital watermark, a color image, into color images. The novelty of our sche...
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
APAL
1998
14 years 9 months ago
1998
A recursive graph is a graph whose vertex and edges sets are recursive. A highly recursive graph is a recursive graph that also has the following property: one can recursively det...