Sciweavers

459 search results - page 5 / 92
» Detecting induced subgraphs
Sort
View
JUCS
2007
99views more  JUCS 2007»
13 years 7 months ago
Spectral Densest Subgraph and Independence Number of a Graph
: In this paper, we study spectral versions of the densest subgraph problem and the largest independence subset problem. In the first part, we give an algorithm for identifying sm...
Reid Andersen, Sebastian M. Cioaba
TCS
2008
13 years 7 months ago
The complexity of uniform Nash equilibria and related regular subgraph problems
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura