Whom to befriend to influence people (Q2292915): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q129718471, #quickstatements; #temporary_batch_1730109530352
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Combinatorial model and bounds for target set selection / 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: Maximizing Social Influence in Nearly Optimal Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreversible conversion of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triggering cascades on undirected connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximability of Influence in Social Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Target Set Selection Problem for Honeycomb Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on the target set selection problem / 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: Spread of influence in weighted networks under time and budget constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Latency-bounded target set selection in social networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contagious Sets in Expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing Spread of Influence in Social Networks via Partial Incentives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recommending links through influence maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contagious sets in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Influence diffusion in social networks under time window constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal contagious sets in random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Whom to befriend to influence people / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to choose friends strategically / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solutions for latency-bounded target set selection problem on some special families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variants of Spreading Messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization algorithm for target set selection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dynamic monopolies of graphs with general thresholds / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129718471 / rank
 
Normal rank

Latest revision as of 11:00, 28 October 2024

scientific article; zbMATH DE number 6658598
  • Whom to Befriend to Influence People
Language Label Description Also known as
English
Whom to befriend to influence people
scientific article; zbMATH DE number 6658598
  • Whom to Befriend to Influence People

Statements

Whom to befriend to influence people (English)
0 references
Whom to Befriend to Influence People (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
6 February 2020
0 references
1 December 2016
0 references
social networks
0 references
influence maximization
0 references
NP-completeness
0 references
greedy algorithms
0 references
graphs
0 references
social network
0 references
minimum links problem
0 references
linear time algorithms
0 references
0 references
0 references
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