Recommending links through influence maximization (Q1731508): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q130031986, #quickstatements; #temporary_batch_1726262144271 |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2963975915 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1706.04368 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Directed scale-free 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: Q5111292 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2941641 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The budgeted maximum coverage problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An analysis of approximations for maximizing submodular set functions—I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Design of Approximation Algorithms / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q130031986 / rank | |||
Normal rank |
Latest revision as of 22:21, 13 September 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Recommending links through influence maximization |
scientific article |
Statements
Recommending links through influence maximization (English)
0 references
13 March 2019
0 references
approximation algorithm
0 references
information diffusion
0 references
complex networks
0 references
independent cascade model
0 references
network augmentation
0 references