Sciweavers

ALGORITHMICA
2010
145views more  ALGORITHMICA 2010»
14 years 5 days ago
Chordal Deletion is Fixed-Parameter Tractable
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...
Dániel Marx