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

zbMATH Keywords

treewidthmonadic second-order logictree decompositiontransduction

Mathematics Subject Classification ID

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

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)

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

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)