Locally checkable problems parameterized by clique-width

DOI10.4230/lipics.isaac.2022.31MaRDI QIDQ6602451

Narmina Baghirova, Carolina Lucía Gonzalez, David Schindl, Bernard Ries

Publication date: 11 September 2024

zbMATH Keywords

dynamic programmingcoloringclique-widthlocally checkable problem

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Finding \(k\)-community structures in special graph classes

This page was built for publication: Locally checkable problems parameterized by clique-width

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