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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica Jg. 75; H. 1; S. 118 - 137
Hauptverfasser:	Cao, Yixin, Marx, Dániel
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.05.2016
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!