{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T01:16:28Z","timestamp":1778807788796,"version":"3.51.4"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T00:00:00Z","timestamp":1643846400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["683080"],"award-info":[{"award-number":["683080"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>The classic algorithm of Bodlaender and Kloks [J. Algorithms, 1996] solves\nthe following problem in linear fixed-parameter time: given a tree\ndecomposition of a graph of (possibly suboptimal) width k, compute an\noptimum-width tree decomposition of the graph. In this work, we prove that this\nproblem can also be solved in mso in the following sense: for every positive\ninteger k, there is an mso transduction from tree decompositions of width k to\ntree decompositions of optimum width. Together with our recent results [LICS\n2016], this implies that for every k there exists an mso transduction which\ninputs a graph of treewidth k, and nondeterministically outputs its tree\ndecomposition of optimum width. We also show that mso transductions can be\nimplemented in linear fixed-parameter time, which enables us to derive the\nalgorithmic result of Bodlaender and Kloks as a corollary of our main result.<\/jats:p>","DOI":"10.46298\/lmcs-18(1:26)2022","type":"journal-article","created":{"date-parts":[[2022,2,2]],"date-time":"2022-02-02T12:55:54Z","timestamp":1643806554000},"source":"Crossref","is-referenced-by-count":6,"title":["Optimizing tree decompositions in MSO"],"prefix":"10.46298","volume":"Volume 18, Issue 1","author":[{"given":"Miko\u0142aj","family":"Boja\u0144czyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Pilipczuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2022,2,3]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/9029\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/9029\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:19:06Z","timestamp":1687292346000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/6993"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,3]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-18(1:26)2022","relation":{"has-preprint":[{"id-type":"arxiv","id":"1701.06937v2","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1701.06937","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1701.06937","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,3]]},"article-number":"6993"}}