24 search results - page 2 / 5 » Voronoi game on graphs and its complexity |
CORR
2007
Springer
13 years 5 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
FSTTCS
2007
Springer
13 years 11 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
FSTTCS
2008
Springer
13 years 6 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...
SIGECOM
2006
ACM
13 years 11 months ago
2006
ACM
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...