Parameterized complexity of safe set

DOI10.1007/978-3-030-17402-6_4OpenAlexW2914832887MaRDI QIDQ2294039

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

Publication date: 6 February 2020

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

zbMATH Keywords

pathwidthclique-widthparameterized complexitysafe setvulnerability parameter

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (3)

Grundy Distinguishes Treewidth from Pathwidth ⋮ Unnamed Item ⋮ Stable structure on safe set problems in vertex-weighted graphs

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