191 search results - page 15 / 39 » Intersections of graphs |
CSJM
2006
13 years 7 months ago
2006
The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A me...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
SMA
2009
ACM
14 years 2 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
MFCS
2004
Springer
14 years 25 days ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...