Chordal Editing is Fixed-Parameter Tractable

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...

Full description

Bibliographic Details

Published in:	Algorithmica Vol. 75; no. 1; pp. 118 - 137
Main Authors:	Cao, Yixin, Marx, Dániel
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.05.2016
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Theory of Computation Chordal deletion Parameterized computation Clique tree decomposition Chordal completion Chordal graph Graph modification problems Holes Simplicial vertex sets
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!