356 search results - page 30 / 72 » Graph Games on Ordinals |
DM
2006
14 years 9 months ago
2006
We give an algorithmic characterisation of finite cop-win digraphs. The case of k > 1 cops and k l 1 robbers is then reduced to the one cop case. Similar characterisations are ...
COMBINATORICS
2007
14 years 9 months ago
2007
RSA
2010
14 years 8 months ago
2010
COCOON
2007
Springer
15 years 3 months ago
2007
Springer
In this paper, we give linear time algorithms to decide core stability, core largeness, exactness, and extendability of flow games on uniform networks (all edge capacities are 1)....
HYBRID
2009
Springer
14 years 7 months ago
2009
Springer
We introduce STORMED hybrid games (SHG), a generalization of STORMED Hybrid Systems [21], which have natural specifications, allow rich continuous dynamics and admit various proper...