Harmless sets in sparse classes

DOI10.1007/978-3-031-06678-8_22MaRDI QIDQ2169963zbMATH OpenOpenAlexFDO

Authors 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

• scientific article; zbMATH DE number 6474901 (Why is no real title available?)
• scientific article; zbMATH DE number 1003278 (Why is no real title available?)
• scientific article; zbMATH DE number 7764102 (Why is no real title available?)
• A \(c^k n\) 5-approximation algorithm for treewidth
• Automata, Languages and Programming
• Characterising bounded expansion by neighbourhood complexity
• Constant-factor approximation of the domination number in sparse graphs
• Contraction Bidimensionality: The Accurate Picture
• Grad and classes with bounded expansion. I: Decompositions
• Graph theory
• Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
• Kernelization and Sparseness: the case of Dominating Set
• Networks, crowds and markets. Reasoning about a highly connected world.
• On the approximability of influence in social networks
• On the harmless set problem parameterized by treewidth
• Parameterized algorithms
• Polynomial kernels and wideness properties of nowhere dense graph classes
• The complexity of finding harmless individuals in social networks

Cited in

(1)

• On Structural Parameterizations of the Harmless Set Problem

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

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