Recommending links through influence maximization (Q1731508): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2018.01.017
@@ Property / DOI: 10.1016/j.tcs.2018.01.017 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W2963975915
@@ Property / OpenAlex ID: W2963975915 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.04368
@@ Property / arXiv ID: 1706.04368 / rank @@
+Normal rank
@@ Property / cites work @@
+Directed scale-free graphs
@@ Property / cites work: Directed scale-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Whom to befriend to influence people
@@ Property / cites work: Whom to befriend to influence people / rank @@
+Normal rank
@@ Property / cites work @@
+Q5111292
@@ Property / cites work: Q5111292 / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Q2941641
@@ Property / cites work: Q2941641 / rank @@
+Normal rank
@@ Property / cites work @@
+The budgeted maximum coverage problem
@@ Property / cites work: The budgeted maximum coverage problem / rank @@
+Normal rank
@@ Property / cites work @@
+An analysis of approximations for maximizing submodular set functions—I
+Normal rank
@@ Property / cites work @@
+The Design of Approximation Algorithms
@@ Property / cites work: The Design of Approximation Algorithms / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q130031986
@@ Property / Wikidata QID: Q130031986 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2018.01.017
@@ Property / DOI: 10.1016/J.TCS.2018.01.017 / rank @@
+Normal rank