90 search results - page 2 / 18 » Finding Hidden Independent Sets in Interval Graphs |
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...
FOCS
2010
IEEE
13 years 3 months ago
2010
IEEE
CPC
2006
13 years 5 months ago
2006
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
SIAMJO
2008
13 years 5 months ago
2008
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
SODA
2010
ACM
14 years 3 months ago
2010
ACM
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...