91 search results - page 2 / 19 » Finding Independent Sets in Unions of Perfect Graphs |
APPROX
2005
Springer
13 years 11 months ago
2005
Springer
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
WEA
2005
Springer
13 years 11 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
A dominating set D of a graph G = (V, E) is a subset of vertices such that every vertex in V \ D has at least one neighbour in D. Moreover if D is an independent set, i.e. no verti...
COCOON
2003
Springer
13 years 10 months ago
2003
Springer
We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied inte...
FOCS
2010
IEEE
13 years 3 months ago
2010
IEEE