Optimizing node discovery on networks: problem definitions, fast algorithms, and observations (Q2201666): Difference between revisions

@@ Property / DOI @@
-.1016/j.ins.2018.10.036
@@ Property / DOI: 10.1016/j.ins.2018.10.036 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W2753387861
@@ Property / OpenAlex ID: W2753387861 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.04307
@@ Property / arXiv ID: 1703.04307 / rank @@
+Normal rank
@@ Property / cites work @@
+The Effect of New Links on Google Pagerank
@@ Property / cites work: The Effect of New Links on Google Pagerank / rank @@
+Normal rank
@@ Property / cites work @@
+Axioms for Centrality
@@ Property / cites work: Axioms for Centrality / rank @@
+Normal rank
@@ Property / cites work @@
+Q3706275
@@ Property / cites work: Q3706275 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on maximizing the spread of influence in social networks
+Normal rank
@@ Property / cites work @@
+Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments
+Normal rank
@@ Property / cites work @@
+Probability Inequalities for Sums of Bounded Random Variables
+Normal rank
@@ Property / cites work @@
+Maximizing PageRank via outlinks
@@ Property / cites work: Maximizing PageRank via outlinks / 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 @@
+Q4878667
@@ Property / cites work: Q4878667 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4149262
@@ Property / cites work: Q4149262 / rank @@
+Normal rank
@@ Property / cites work @@
+An analysis of approximations for maximizing submodular set functions—I
+Normal rank
@@ Property / cites work @@
+A note on maximizing a submodular set function subject to a knapsack constraint
+Normal rank
@@ Property / cites work @@
+Probability and Statistics with Reliability, Queuing and Computer Science Applications
+Normal rank
@@ Property / cites work @@
+I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs
+Normal rank
@@ Property / DOI @@
+.1016/J.INS.2018.10.036
@@ Property / DOI: 10.1016/J.INS.2018.10.036 / rank @@
+Normal rank