On the complexity of target set selection in simple geometric networks

DOI10.46298/DMTCS.11591zbMATH Open1544.91238MaRDI QIDQ6606994

Could not fetch data.

Publication date: 17 September 2024

Published in: (Search for Journal in Brave)

Could not fetch data.

Epidemiology (92D30) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Sphere and dot product representations of graphs
Treewidth governs the complexity of target set selection
Irreversible conversion of graphs
Graphen und Matrices.
Maximum independent sets in 3- and 4-regular Hamiltonian graphs
The parameterized complexity of editing graphs for bounded degeneracy
Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
Independent domination in chordal graphs
Unit disk graphs
Unit disk graph recognition is NP-hard
Dynamic monopolies for interval graphs with bounded thresholds
Some results on the target set selection problem
A note on the fine-grained complexity of MIS on regular graphs
Target set selection parameterized by vertex cover and more
Constant thresholds can make target set selection tractable
Latency-bounded target set selection in social networks
Solving target set selection with bounded thresholds faster than \(2^n\)
On the Approximability of Influence in Social Networks
Universality considerations in VLSI circuits
The Complexity of Multiterminal Cuts
Irreversible 2-conversion set in graphs of bounded degree
Target Set Selection in Dense Graph Classes
Target Set Selection Parameterized by Clique-Width and Maximum Threshold
Variants of Spreading Messages
Representing graphs by disks and balls (a survey of recognition-complexity results)
Establishing herd immunity is hard even in simple geometric networks
Target set selection with maximum activation time
Being an influencer is hard: the complexity of influence maximization in temporal graphs with a fixed source
A faster combinatorial algorithm for maximum bipartite matching

This page was built for publication: On the complexity of target set selection in simple geometric networks

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