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

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 81; no. 10; pp. 3890 - 3935
Main Authors:	Bonnet, Édouard, Brettell, Nick, Kwon, O-joung, Marx, Dániel
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.10.2019 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!