173 search results - page 11 / 35 » Every color chromakey |
195
click to vote
SIAMDM
2010
15 years 1 months ago
2010
The following problem was introduced by Marcin Krzywkowski as a generalization of a problem of Todd Ebert. After initially coordinating a strategy, n players each occupy a differe...
180
click to vote
MFCS
2007
Springer
16 years 23 days ago
2007
Springer
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...
165
click to vote
COCO
2007
Springer
16 years 25 days ago
2007
Springer
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...
154
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
176
click to vote
AAIM
2005
Springer
16 years 6 days ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...