Sciweavers

124

Voted

IWPEC
2009
Springer

118views Applied Computing» more IWPEC 2009»

Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover

15 years 9 months ago

We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...

Peter Damaschke

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Sciweavers