A logic-based algorithmic meta-theorem for mim-width

DOI10.1137/1.9781611977554.CH125MaRDI QIDQ6538656zbMATH OpenFDO

Authors Benjamin Bergougnoux, Jan Dreier, Lars Jaffke

Publication date 14 May 2024

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(2)

• Conflict-free coloring: graphs of bounded clique-width and intersection graphs
• Connected feedback vertex set on AT-free graphs

This page was built for publication: A logic-based algorithmic meta-theorem for mim-width

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