Sciweavers

2322 search results - page 101 / 465
» On a game in directed graphs
Sort
View
GD
2007
Springer
16 years 1 months ago
Moving Vertices to Make Drawings Plane
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by m...
Xavier Goaoc, Jan Kratochvíl, Yoshio Okamot...
LICS
2003
IEEE
16 years 7 days ago
Micro-Macro Stack Systems: A New Frontier of Elementary Decidability for Sequential Systems
We define the class of micro-macro stack graphs, a new class of graphs modeling infinite-state sequential systems with a decidable model-checking problem. Micro-macro stack grap...
Nir Piterman, Moshe Y. Vardi
220
Voted
FOCS
2008
IEEE
16 years 1 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
ATAL
2010
Springer
15 years 8 months ago
Path disruption games
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
Yoram Bachrach, Ely Porat
CSL
2006
Springer
15 years 10 months ago
Solving Games Without Determinization
The synthesis of reactive systems requires the solution of two-player games on graphs with -regular objectives. When the objective is specified by a linear temporal logic formula o...
Thomas A. Henzinger, Nir Piterman