760 search results - page 5 / 152 » Algorithms for finding clique-transversals of graphs |
APPROX
2005
Springer
14 years 1 months ago
2005
Springer
COCO
1995
Springer
13 years 11 months ago
1995
Springer
SODA
1998
ACM
13 years 8 months ago
1998
ACM
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
Let G be an n-vertex graph that has a vertex separator of size k that partitions the graph into connected components of size smaller