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

From MaRDI portal
Set OpenAlex properties.
Merged Item from Q2948469
(4 intermediate revisions by 3 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

Revision as of 13:19, 29 April 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