scientific article; zbMATH DE number 6862107

DOI10.4230/LIPICS.STACS.2017.15MaRDI QIDQ4636613zbMATH OpenFDO

Authors Mikołaj Bojańczyk, Michał Pilipczuk

Publication date 19 April 2018

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2017.15

zbMATH Keywords

monadic second-order logictransductiontree decompositiontreewidth

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Optimizing tree decompositions in MSO
• Computing Optimal Hypertree Decompositions
• \(k\)-best solutions of MSO problems on tree-decomposable graphs
• Tree decomposition and discrete optimization problems: a survey
• scientific article; zbMATH DE number 20617
• Finding good tree decompositions by local search
• Improving the efficiency of dynamic programming on tree decompositions via machine learning
• scientific article; zbMATH DE number 708667
• scientific article; zbMATH DE number 6678444

Cited in

(13)

• A polynomial excluded-minor approximation of treedepth
• Typical sequences revisited -- computing width parameters of graphs
• scientific article; zbMATH DE number 6678444 (Why is no real title available?)
• On supergraphs satisfying CMSO properties
• Optimizing tree decompositions in MSO
• Computing Tree Decompositions
• A linear fixed parameter tractable algorithm for connected pathwidth
• scientific article; zbMATH DE number 7559390 (Why is no real title available?)
• \(k\)-best solutions of MSO problems on tree-decomposable graphs
• Evaluation of an MSO-Solver
• Definable decompositions for graphs of bounded linear cliquewidth
• scientific article; zbMATH DE number 7651203 (Why is no real title available?)
• Complexity of secure sets

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4636613)