762 search results - page 89 / 153 » Strategic Coloring of a Graph |
161
click to vote
MFCS
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
126
click to vote
COMBINATORICS
2004
15 years 4 months ago
2004
The Ramsey game we consider in this paper is played on an unbounded set of vertices by two players, called Builder and Painter. In one move Builder introduces a new edge and Paint...
148
click to vote
DM
1999
15 years 4 months ago
1999
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
143
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
162
click to vote
CSE
2009
IEEE
15 years 8 months ago
2009
IEEE
Social networks are the substrate upon which we make and evaluate many of our daily decisions: our costs and benefits depend on whether--or how many of, or which of--our friends ar...