2322 search results - page 14 / 465 » On a game in directed graphs |
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
A spanner of a graph is a sparse subgraph that approximately preserves distances in the original graph. More precisely, a subgraph H = (V, EH ) is a k-spanner of a graph G = (V, E...
TAMC
2010
Springer
14 years 1 months ago
2010
Springer
An instance of the max k−cut game is an edge weighted graph. Every
VMCAI
2009
Springer
14 years 3 months ago
2009
Springer
We study price-per-reward games on hybrid automata with strong resets. They generalise priced games previously studied and have applications in scheduling. We obtain decidability r...
FOSSACS
2008
Springer
13 years 10 months ago
2008
Springer
We consider turn-based stochastic games on infinite graphs induced by game probabilistic lossy channel systems (GPLCS), the game version of probabilistic lossy channel systems (PLC...
FOSSACS
2006
Springer
14 years 4 days ago
2006
Springer
We consider parity games played on special pushdown graphs, namely those generated by one-counter processes. For parity games on pushdown graphs, it is known from [22] that decidin...