The complexity of finding effectors (Q519899): Difference between revisions

From MaRDI portal
Merged Item from Q2948469
Created claim: DBLP publication ID (P1635): conf/tamc/BulteauFFNT15, #quickstatements; #temporary_batch_1731468600454
(2 intermediate revisions by one other user not shown)
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explaining Snapshots of Network Diffusions: Structural and Hardness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth governs the complexity of target set selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant thresholds can make target set selection tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2941641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable influence maximization for independent cascade model in large-scale social networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Inapproximability of Target Set Selection and Generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized approximability of maximizing the spread of influence in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of multiple-interval graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Tractable Cases of Target Set Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: conf/tamc/BulteauFFNT15 / rank
 
Normal rank

Revision as of 04:34, 13 November 2024

scientific article; zbMATH DE number 6487893
  • The Complexity of Finding Effectors
Language Label Description Also known as
English
The complexity of finding effectors
scientific article; zbMATH DE number 6487893
  • The Complexity of Finding Effectors

Statements

The complexity of finding effectors (English)
0 references
The Complexity of Finding Effectors (English)
0 references
0 references
0 references
0 references
0 references
0 references
31 March 2017
0 references
30 September 2015
0 references
probabilistic information propagation
0 references
influence maximization
0 references
network activation
0 references
social networks
0 references
exact algorithms
0 references
parameterized complexity
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references