Sciweavers

42230 search results - page 32 / 8446
» Algorithms and Complexity Results for
Sort
View
WG
2007
Springer
14 years 2 months ago
Complexity and Approximation Results for the Connected Vertex Cover Problem
We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...
Bruno Escoffier, Laurent Gourvès, Jé...
WINE
2005
Springer
124views Economy» more  WINE 2005»
14 years 1 months ago
New Results on the Complexity of Uniformly Mixed Nash Equilibria
Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura