Parameterized complexity of binary CSP: vertex cover, treedepth, and related parameters

DOI10.4230/LIPICS.ICALP.2023.27MaRDI QIDQ6638020FDOQ6638020

Authors Hans L. Bodlaender, Carla Groenland, Michał Pilipczuk 

Publication date 14 November 2024

zbMATH Keywords

list coloringconstraint satisfaction problemsparameterized complexityvertex coverW-hierarchytreedepthbinary CSP

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cited in

(1)

• The parameterized complexity of maximum betweenness centrality

This page was built for publication: Parameterized complexity of binary CSP: vertex cover, treedepth, and related parameters

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