Optimizing tree decompositions in MSO

The classic algorithm of Bodlaender and Kloks [J. Algorithms, 1996] solves the following problem in linear fixed-parameter time: given a tree decomposition of a graph of (possibly suboptimal) width k, compute an optimum-width tree decomposition of the graph. In this work, we prove that this problem...

Celý popis

Podrobná bibliografia

Vydané v:	Logical methods in computer science Ročník 18, Issue 1
Hlavní autori:	Bojańczyk, Mikołaj, Pilipczuk, Michał
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Logical Methods in Computer Science e.V 03.02.2022
Predmet:	computer science - data structures and algorithms computer science - discrete mathematics computer science - logic in computer science
ISSN:	1860-5974, 1860-5974
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!