2322 search results - page 103 / 465 » On a game in directed graphs |
143
click to vote
CONCUR
2007
Springer
16 years 14 days ago
2007
Springer
The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of λ-terms and PCF programs. An innocent strategy is defined as an ...
175
click to vote
AIRWEB
2007
Springer
16 years 15 days ago
2007
Springer
Web spam can significantly deteriorate the quality of search engines. Early web spamming techniques mainly manipulate page content. Since linkage information is widely used in we...
161
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We investigate here the computational complexity of three natural problems in directed acyclic graphs. We prove their NP Completeness and consider their restrictions to linear orde...
139
click to vote
CG
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. A one-player, finite, probabilistic game with perfect information can be presented as a bipartite graph. For one-player Can't Stop, the graph is cyclic and the chall...
157
click to vote
SIAMDM
2010
15 years 1 months ago
2010
The firefighter problem is the following discrete-time game on a graph. Initially, a fire starts at a vertex of the graph. In each round, a firefighter protects one vertex not yet ...