Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms

It has long been known that Feedback Vertex Set can be solved in time 2 O ( w log w ) n O ( 1 ) on n -vertex graphs of treewidth w , but it was only recently that this running time was improved to 2 O ( w ) n O ( 1 ) , that is, to single-exponential parameterized by treewidth. We investigate which g...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 81; H. 10; S. 3890 - 3935
Hauptverfasser:	Bonnet, Édouard, Brettell, Nick, Kwon, O-joung, Marx, Dániel
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.10.2019 Springer Nature B.V
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Apexes Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Deletion Feedback Graph theory Graphs Mathematics of Computing Parameterization Polynomials Special Issue: Parameterized and Exact Computation Theory of Computation Chordal graph Feedback Vertex Set Parameterized complexity Treewidth
ISSN:	0178-4617, 1432-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!