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...
שמור ב:
| Principais autores: | , |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
Logical Methods in Computer Science e.V.
2022-02-01
|
| סדרה: | Logical Methods in Computer Science |
| נושאים: | |
| גישה מקוונת: | https://lmcs.episciences.org/6993/pdf |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|