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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Logical methods in computer science Jg. 18, Issue 1
Hauptverfasser: Bojańczyk, Mikołaj, Pilipczuk, Michał
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Logical Methods in Computer Science e.V 03.02.2022
Schlagworte:
computer science - data structures and algorithms
computer science - discrete mathematics
computer science - logic in computer science
ISSN:1860-5974, 1860-5974
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract 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 can also be solved in mso in the following sense: for every positive integer k, there is an mso transduction from tree decompositions of width k to tree decompositions of optimum width. Together with our recent results [LICS 2016], this implies that for every k there exists an mso transduction which inputs a graph of treewidth k, and nondeterministically outputs its tree decomposition of optimum width. We also show that mso transductions can be implemented in linear fixed-parameter time, which enables us to derive the algorithmic result of Bodlaender and Kloks as a corollary of our main result.
AbstractList 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 can also be solved in mso in the following sense: for every positive integer k, there is an mso transduction from tree decompositions of width k to tree decompositions of optimum width. Together with our recent results [LICS 2016], this implies that for every k there exists an mso transduction which inputs a graph of treewidth k, and nondeterministically outputs its tree decomposition of optimum width. We also show that mso transductions can be implemented in linear fixed-parameter time, which enables us to derive the algorithmic result of Bodlaender and Kloks as a corollary of our main result.
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 can also be solved in mso in the following sense: for every positive integer k, there is an mso transduction from tree decompositions of width k to tree decompositions of optimum width. Together with our recent results [LICS 2016], this implies that for every k there exists an mso transduction which inputs a graph of treewidth k, and nondeterministically outputs its tree decomposition of optimum width. We also show that mso transductions can be implemented in linear fixed-parameter time, which enables us to derive the algorithmic result of Bodlaender and Kloks as a corollary of our main result.
Author Bojańczyk, Mikołaj
Pilipczuk, Michał
Author_xml – sequence: 1
  givenname: Mikołaj
  surname: Bojańczyk
  fullname: Bojańczyk, Mikołaj
– sequence: 2
  givenname: Michał
  surname: Pilipczuk
  fullname: Pilipczuk, Michał
BookMark eNpNkD1PwzAURS1UJErpH2DKggRDwH52HIcNIT4qFXUAZst5titXTVzZWeDXk7YIcZd73xvOcM7JpI-9I-SS0VshoVF32w5zydQ1uwd5AxTghEyZkrSsmlpM_u0zMs95Q8dwzhTIKbla7YbQhe_Qr4shOVdYh7HbxRyGEPtchL54e19dkFNvttnNf3tGPp-fPh5fy-XqZfH4sCwRgEPp0TtbqdpZ2hoEVtlWAhqH0FTjVbW0FqpFcCi4HDdUTcskiJpx6pEbPiOLI9dGs9G7FDqTvnQ0QR8eMa21SUPArdNt5UXLqLLCcdEIoWpA770waC3lCCMLjixMMefk_B-PUX3wpvfeNFOaaZB6743_AKT2Yhs
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.46298/lmcs-18(1:26)2022
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList
CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1860-5974
ExternalDocumentID oai_doaj_org_article_b5f4b108d4e34944872cfff4acdd03c2
10_46298_lmcs_18_1_26_2022
GroupedDBID .4S
.DC
29L
2WC
5GY
5VS
AAFWJ
AAYXX
ADBBV
ADMLS
ADQAK
AENEX
AFPKN
ALMA_UNASSIGNED_HOLDINGS
ARCSS
BCNDV
CITATION
EBS
EJD
FRP
GROUPED_DOAJ
J9A
KQ8
MK~
ML~
M~E
OK1
OVT
P2P
TR2
TUS
XSB
ID FETCH-LOGICAL-c2232-fcfed587ed0bac215db62caec2952155b0748bc2ec436074259b16247130fc3a3
IEDL.DBID DOA
ISSN 1860-5974
IngestDate Fri Oct 03 12:38:40 EDT 2025
Sat Nov 29 06:21:51 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
License https://creativecommons.org/licenses/by/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c2232-fcfed587ed0bac215db62caec2952155b0748bc2ec436074259b16247130fc3a3
ORCID 0000-0001-7891-1988
OpenAccessLink https://doaj.org/article/b5f4b108d4e34944872cfff4acdd03c2
ParticipantIDs doaj_primary_oai_doaj_org_article_b5f4b108d4e34944872cfff4acdd03c2
crossref_primary_10_46298_lmcs_18_1_26_2022
PublicationCentury 2000
PublicationDate 2022-02-03
PublicationDateYYYYMMDD 2022-02-03
PublicationDate_xml – month: 02
  year: 2022
  text: 2022-02-03
  day: 03
PublicationDecade 2020
PublicationTitle Logical methods in computer science
PublicationYear 2022
Publisher Logical Methods in Computer Science e.V
Publisher_xml – name: Logical Methods in Computer Science e.V
SSID ssj0000331826
Score 2.2942772
Snippet The classic algorithm of Bodlaender and Kloks [J. Algorithms, 1996] solves the following problem in linear fixed-parameter time: given a tree decomposition of...
The classic algorithm of Bodlaender and Kloks [J. Algorithms, 1996] solves the following problem in linear fixed-parameter time: given a tree decomposition of...
SourceID doaj
crossref
SourceType Open Website
Index Database
SubjectTerms computer science - data structures and algorithms
computer science - discrete mathematics
computer science - logic in computer science
Title Optimizing tree decompositions in MSO
URI https://doaj.org/article/b5f4b108d4e34944872cfff4acdd03c2
Volume 18, Issue 1
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 1860-5974
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000331826
  issn: 1860-5974
  databaseCode: DOA
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1860-5974
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000331826
  issn: 1860-5974
  databaseCode: M~E
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LSwMxEA5SPHjxLdYXe1BQZOkm2UfiTaXFS1tBhd5CMptAwW6lrR48-NudZLdST1687CEsIfmGzPcNmcwQcu4SQNcoTcws89eMFmJpc4hp4aSwoA11JjSbKAYDMRrJx5VWXz4nrC4PXAPXMZlLDU1EmVpfSQX1NQPnXKqhLBMOwfui6lkJpoIP5twL5_qVTJozKTqvE5jHVFzSG5ZfYcjPfjHRSsH-wCy9bbLZSMLotl7KDlmz1S7ZWrZbiJrTt0cuhni8J-NPJJvI3yVHpfUJ4cusq2hcRf2n4T556XWf7x_ipstBDEjNLHbgbJmJwpaJ0YAMXJqcgbbAJFJrlhkkeWGAWUh57iPZTBqaMyQVnjjgmh-QVjWt7CGJqOFWaxRxOkG4ikJInFqnGWqsQnORtsn1csfqrS5moTAICPgoj4-iQlHFcuXxaZM7D8rPn74QdRhA86jGPOov8xz9xyTHZMMvKCRL8xPSWsze7SlZh4_FeD47C5bHb_-r-w0Z5LQr
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Optimizing+tree+decompositions+in+MSO&rft.jtitle=Logical+methods+in+computer+science&rft.au=Miko%C5%82aj+Boja%C5%84czyk&rft.au=Micha%C5%82+Pilipczuk&rft.date=2022-02-03&rft.pub=Logical+Methods+in+Computer+Science+e.V&rft.eissn=1860-5974&rft.volume=18%2C+Issue+1&rft_id=info:doi/10.46298%2Flmcs-18%281%3A26%292022&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_b5f4b108d4e34944872cfff4acdd03c2
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1860-5974&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1860-5974&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1860-5974&client=summon