The complexity of finding effectors (Q519899): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Revision as of 14:20, 13 July 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 |
|
Statements
The complexity of finding effectors (English)
0 references
The Complexity of Finding Effectors (English)
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
0 references
