356 search results - page 14 / 72 » Graph Games on Ordinals |
CGVR
2008
14 years 11 months ago
2008
- A graph drawing algorithm for the Game of Sprouts is presented. The algorithm guarantees that the polylines that connect graph nodes are drawn smoothly and that they maintain rea...
MFCS
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
COMBINATORICS
2004
14 years 9 months ago
2004
The Ramsey game we consider in this paper is played on an unbounded set of vertices by two players, called Builder and Painter. In one move Builder introduces a new edge and Paint...
TACAS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Failing model checking runs should be accompanied by appropriate error diagnosis information that allows the user to identify the cause of the problem. For branching time...
ECCC
2010
14 years 9 months ago
2010
The parallel repetition theorem states that for any Two Prover Game with value at most 1 - (for < 1/2), the value of the game repeated n times in parallel is at most (1 - 3 )(n...