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

From MaRDI portal
Set OpenAlex properties.
Created claim: DBLP publication ID (P1635): conf/tamc/BulteauFFNT15, #quickstatements; #temporary_batch_1731468600454
 
(7 intermediate revisions by 4 users not shown)
aliases / en / 0aliases / en / 0
 
The Complexity of Finding Effectors
description / endescription / en
scientific article
scientific article; zbMATH DE number 6487893
Property / title
 
The Complexity of Finding Effectors (English)
Property / title: The Complexity of Finding Effectors (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1362.68101 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-17142-5_20 / rank
 
Normal rank
Property / published in
 
Property / published in: Lecture Notes in Computer Science / rank
 
Normal rank
Property / publication date
 
30 September 2015
Timestamp+2015-09-30T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 30 September 2015 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6487893 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2619074938 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q62039059 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q62039079 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1411.7838 / rank
 
Normal rank
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

Latest 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