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 algorithm for both problems: the running time is f(k)

• Type: Journal
• Year: 2010
• Where: ALGORITHMICA
• Authors: Dániel Marx
• Keywords: Algorithm, ALGORITHMICA 2010, Chordal, Uniformly Polynomial-time