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...
Wedi'i Gadw mewn:
| Prif Awduron: | , |
|---|---|
| Fformat: | Artigo |
| Iaith: | Inglês |
| Cyhoeddwyd: |
Logical Methods in Computer Science e.V.
2022-02-01
|
| Cyfres: | Logical Methods in Computer Science |
| Pynciau: | |
| Mynediad Ar-lein: | https://lmcs.episciences.org/6993/pdf |
| Tagiau: |
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|