Chordal Editing is FixedParameter Tractable
Cao, Yixin and Marx, Dániel (2016) Chordal Editing is FixedParameter Tractable. ALGORITHMICA, 75 (1). pp. 118137. ISSN 01784617 10.1007/s004530150014x
Text
Cao_118_3155766_ny.pdf Download (335kB) 

Text
Cao_118_3155766_z.pdf Restricted to Registered users only Download (549kB)  Request a copy 
Abstract
Graph modification problems typically ask for a small set of operations that transforms a given graph to have a certain property. The most commonly considered operations include vertex deletion, edge deletion, and edge addition; for the same property, one can define significantly different versions by allowing different operations. We study a very general graph modification problem that allows all three types of operations: given a graph and integers k(1), k(2), and k(3), the CHORDAL EDITING problem asks whether G can be transformed into a chordal graph by at most k(1) vertex deletions, k(2) edge deletions, and k(3) edge additions. Clearly, this problem generalizes both CHORDAL DELETION and CHORDAL COMPLETION (also known as MINIMUM FILLIN). Our main result is an algorithm for CHORDAL EDITING in time 2(O(klog k)). n(O(1)), where k:=k(1) + k(2) + k(3) and n is the number of vertices of G. Therefore, the problem is fixedparameter tractable parameterized by the total number of allowed operations. Our algorithm is both more efficient and conceptually simpler than the previously known algorithm for the special case CHORDAL DELETION.
Item Type:  Article 

Subjects:  Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány 
Divisions:  Informatics Laboratory 
SWORD Depositor:  MTMT Injector 
Depositing User:  MTMT Injector 
Date Deposited:  29 Jan 2017 20:38 
Last Modified:  29 Jan 2017 20:38 
URI:  http://eprints.sztaki.hu/id/eprint/9048 
Update Item 