45 search results - page 4 / 9 » Distortion Is Fixed Parameter Tractable |
ALGORITHMICA
2010
13 years 11 months ago
2010
It is known to be NP-hard to decide whether a graph can be made chordal by the deletion of k vertices or by the deletion of k edges. Here we present a uniformly polynomial-time alg...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
CORR
2010
Springer
13 years 8 months ago
2010
Springer
LICS
2006
IEEE
14 years 4 months ago
2006
IEEE
Treewidth measures the ”tree-likeness” of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this wo...
PPSN
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...