Tight algorithmic applications of clique-width generalizations

DOI10.4230/LIPICS.MFCS.2023.35MaRDI QIDQ6647663zbMATH OpenFDO

Authors Vera Chekan, Stefan Kratsch

Publication date 3 December 2024

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2023.35

zbMATH Keywords

clique-widthconnectivity problemsparameterized complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(1)

• On the complexity of establishing hereditary graph properties via vertex splitting

This page was built for publication: Tight algorithmic applications of clique-width generalizations

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