On supergraphs satisfying CMSO properties

DOI10.4230/LIPICS.CSL.2017.33zbMATH Open1440.68113MaRDI QIDQ5111201FDOQ5111201

Authors: Mateus de Oliveira Oliveira 

Publication date: 26 May 2020

Recommendations

• Reducing CMSO model checking to highly connected graphs
• Large induced subgraphs via triangulations and CMSO
• Large Induced Subgraphs via Triangulations and CMSO
• Algorithmic meta-theorems for restrictions of treewidth
• Algorithmic meta-theorems for restrictions of treewidth

zbMATH Keywords

algorithmic metatheoremsbidimensionalitygraph completionCMSO-logic

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Higher-order logic (03B16) Logic in computer science (03B70) Parameterized complexity, tractability and kernelization (68Q27)

Cited In (4)

• Reducing CMSO model checking to highly connected graphs
• A strongly-uniform slicewise polynomial-time algorithm for the embedded planar diameter improvement problem
• Supergraphs and the cubic Leigh-Strassler model
• Title not available (Why is that?)

This page was built for publication: On supergraphs satisfying CMSO properties

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