EDBT

2012

ACM

12 years 1 months ago
2012

ACM

Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...

COLOGNETWENTE

2010

13 years 9 months ago
2010

We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is ﬂipp...

WG

2005

Springer

14 years 4 months ago
2005

Springer

In unweighted case, approximation ratio for the independent set problem has been analyzed in terms of the graph parameters, such as the number of vertices, maximum degree, and aver...

ISAAC

2009

Springer

14 years 5 months ago
2009

Springer

We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded eﬃcient algorithms ...

FSTTCS

2009

Springer

14 years 5 months ago
2009

Springer

ABSTRACT. We present a simple exact algorithm for the INDEPENDENT SET problem with a run

COCOON

2009

Springer

14 years 5 months ago
2009

Springer

We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...