The parameterized complexity of dominating set and friends revisited for structured graphs

DOI10.1007/978-3-030-19955-5_26OpenAlexW2951988738MaRDI QIDQ2330569

Neeldhara Misra, Piyush Rathi

Publication date: 22 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-19955-5_26

zbMATH Keywords

dominating setW-hardnessstructural parameterskernelizationFPTefficient domination

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Structural parameterizations of dominating set variants ⋮ On the complexity of fixed parameter clique and dominating set

This page was built for publication: The parameterized complexity of dominating set and friends revisited for structured graphs

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