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

Full description

Bibliographic Details

Published in:	Logical methods in computer science Vol. 18, Issue 1
Main Authors:	Bojańczyk, Mikołaj, Pilipczuk, Michał
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science e.V 03.02.2022
Subjects:	computer science - data structures and algorithms computer science - discrete mathematics computer science - logic in computer science
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!