Harmless sets in sparse classes

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

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

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

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)