The complexity of finding harmless individuals in social networks

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Fundamentals of parameterized complexity
Optimization, approximation, and complexity classes
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
A partial k-arboretum of graphs with bounded treewidth
Clique is hard to approximate within \(n^{1-\epsilon}\)
Local majorities, coalitions and monopolies in graphs: A review
Some results on the target set selection problem
Parametrized complexity theory.
The Robust Set Problem: Parameterized Complexity and Approximation
On the Approximability of Influence in Social Networks
Total domination in graphs
Approximation algorithms for NP-complete problems on planar graphs
Treewidth governs the complexity of target set selection
Total Domination in Graphs
\(k\)-tuple total domination in graphs
Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
Treewidth. Computations and approximations
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
Irreversible conversion of graphs
Fixed-parameter tractability and completeness II: On completeness for W[1]
Domination in Graphs Applied to Electric Power Networks
The Turing way to parameterized complexity
Approximation Algorithms and Hardness for Domination with Propagation
SOFSEM 2006: Theory and Practice of Computer Science
On Syntactic versus Computational Views of Approximability
Parameterized complexity of generalized domination problems
Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment
Constant thresholds can make target set selection tractable
A survey on alliances and related parameters in graphs
Variants of spreading messages
Parameterized Approximability of Maximizing the Spread of Influence in Networks

Cited In (5)

A parameterized complexity view on collapsing \(k\)-cores
Inferring local transition functions of discrete dynamical systems from observations of system behavior
On the harmless set problem parameterized by treewidth
Harmless sets in sparse classes
On Structural Parameterizations of the Harmless Set Problem

This page was built for publication: The complexity of finding harmless individuals in social networks

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