2 search results - page 1 / 1 » Pareto Complexity of Two-Parameter FPT Problems: A Case Stud... |
IWPEC
2009
Springer
13 years 11 months ago
2009
Springer
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...
IWPEC
2009
Springer
13 years 11 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...