1749 search results - page 230 / 350 » Conditional colorings of graphs |
161
click to vote
LICS
1997
IEEE
15 years 10 months ago
1997
IEEE
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
169
click to vote
ACSD
2008
IEEE
15 years 8 months ago
2008
IEEE
We present a process algebra with conditionally distributed discrete-time delays and generally-distributed stochastic delays. The treatment allows for expansion laws for the paral...
195
click to vote
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper proposes a local gradient control law to stabilize a group of robots to a target formation. The control is derived from a potential function based on an undirected infin...
135
Voted
DM
2006
15 years 6 months ago
2006
For a set X of vertices of a graph fulfilling local connectedness conditions the existence of a cycle containing X is proved. AMS classification: 05C38, 05C45, 05C35
143
click to vote
JETAI
2002
15 years 6 months ago
2002
Several algorithms that generate the set of all formal concepts and diagram graphs of concept lattices are considered. Some modifications of wellknown algorithms are proposed. Algo...