2322 search results - page 26 / 465 » On a game in directed graphs |
COCO
2007
Springer
14 years 2 months ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
FSTTCS
2008
Springer
13 years 9 months ago
2008
Springer
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
NIPS
2004
13 years 10 months ago
2004
Given a directed graph in which some of the nodes are labeled, we investigate the question of how to exploit the link structure of the graph to infer the labels of the remaining u...
ISCAPDCS
2003
13 years 10 months ago
2003
In this paper, we present a system partitioning technique in which the input system specification is based on C++ language. The proposed technique processes data and precedence de...
DM
2010
13 years 8 months ago
2010
In this paper we give a full characterization of the idomatic partitions of the direct product of three complete graphs. We also show how to use such a characterization in order t...