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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 81; číslo 10; s. 3890 - 3935
Hlavní autoři:	Bonnet, Édouard, Brettell, Nick, Kwon, O-joung, Marx, Dániel
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.10.2019 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!