Parameterized complexity of safe set

DOI10.1007/978-3-030-17402-6_4MaRDI QIDQ2294039zbMATH OpenOpenAlexFDO

Authors Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi

Publication date 6 February 2020

Full work available at URL https://arxiv.org/abs/1901.09434

zbMATH Keywords

clique-widthparameterized complexitypathwidthsafe setvulnerability parameter

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Parameterized complexity of safe set
• Safe sets in graphs: graph classes and structural parameters
• Safe sets in graphs: graph classes and structural parameters
• Parameterized complexity of secure sets
• Complexity of secure sets

Cited in

(5)

• Stable structure on safe set problems in vertex-weighted graphs
• Grundy Distinguishes Treewidth from Pathwidth
• Grundy distinguishes treewidth from pathwidth
• A combinatorial branch and bound for the safe set problem
• Parameterized algorithms and data reduction for safe convoy routing

This page was built for publication: Parameterized complexity of safe set

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