On some tractable and hard instances for partial incentives and target set selection (Q2010927): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2962944345
@@ Property / OpenAlex ID: W2962944345 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.10086
@@ Property / arXiv ID: 1805.10086 / rank @@
+Normal rank
@@ Property / cites work @@
+Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
+Normal rank
@@ Property / cites work @@
+Q2941641
@@ Property / cites work: Q2941641 / rank @@
+Normal rank
@@ Property / cites work @@
+Irreversible conversion of graphs
@@ Property / cites work: Irreversible conversion of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Approximability of Influence in Social Networks
+Normal rank
@@ Property / cites work @@
+Treewidth governs the complexity of target set selection
+Normal rank
@@ Property / cites work @@
+Dynamic monopolies for interval graphs with bounded thresholds
+Normal rank
@@ Property / cites work @@
+Irreversible 2-conversion set in graphs of bounded degree
+Normal rank
@@ Property / cites work @@
+Optimizing Spread of Influence in Social Networks via Partial Incentives
+Normal rank
@@ Property / cites work @@
+Combinatorial model and bounds for target set selection
+Normal rank
@@ Property / cites work @@
+New bounds for contagious sets
@@ Property / cites work: New bounds for contagious sets / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
+Normal rank
@@ Property / cites work @@
+Constant thresholds can make target set selection tractable
+Normal rank
@@ Property / cites work @@
+Target Set Selection Parameterized by Clique-Width and Maximum Threshold
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Q2921717
@@ Property / cites work: Q2921717 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+Some results on the target set selection problem
@@ Property / cites work: Some results on the target set selection problem / rank @@
+Normal rank
@@ Property / cites work @@
+Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms and Hardness for Domination with Propagation
+Normal rank
@@ Property / cites work @@
+Treewidth of graphs with balanced separations
@@ Property / cites work: Treewidth of graphs with balanced separations / rank @@
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q127728240
@@ Property / Wikidata QID: Q127728240 / rank @@
+Normal rank