Harmless sets in sparse classes

DOI10.1007/978-3-031-06678-8_22OpenAlexW4285209940MaRDI QIDQ2169963

Pål Grønås Drange, Irene Muzi, Felix Reidl

Publication date: 30 August 2022

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
• Characterising bounded expansion by neighbourhood complexity
• Constant-factor approximation of the domination number in sparse graphs
• On the harmless set problem parameterized by treewidth
• The complexity of finding harmless individuals in social networks
• Grad and classes with bounded expansion. I: Decompositions
• A $c^k n$ 5-Approximation Algorithm for Treewidth
• Graph Theory
• On the Approximability of Influence in Social Networks
• Contraction Bidimensionality: The Accurate Picture
• Kernelization and Sparseness: the case of Dominating Set
• Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes
• Deciding First-Order Properties of Nowhere Dense Graphs
• Parameterized Algorithms
• Automata, Languages and Programming

This page was built for publication: Harmless sets in sparse classes