Improving the Betweenness Centrality of a Node by Adding Links (Q4555544): Difference between revisions

@@ 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 @@
+The Shortcut Problem - Complexity and Algorithms
@@ Property / cites work: The Shortcut Problem - Complexity and Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Branching and bounds tighteningtechniques for non-convex MINLP
+Normal rank
@@ Property / cites work @@
+Computing Top-<i>k</i> Closeness Centrality Faster in Unweighted Graphs
+Normal rank
@@ Property / cites work @@
+Approximating Betweenness Centrality in Fully Dynamic Networks
+Normal rank
@@ Property / cites work @@
+Q4580179
@@ Property / cites work: Q4580179 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Betweenness Centrality in Large Evolving Networks
+Normal rank
@@ Property / cites work @@
+Improved approximability and non-approximability results for graph diameter decreasing problems
+Normal rank
@@ Property / cites work @@
+Q4471287
@@ Property / cites work: Q4471287 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4606289
@@ Property / cites work: Q4606289 / rank @@
+Normal rank
@@ Property / cites work @@
+A faster algorithm for betweenness centrality*
@@ Property / cites work: A faster algorithm for betweenness centrality* / rank @@
+Normal rank
@@ Property / cites work @@
+Models for the Compressible Web
@@ Property / cites work: Models for the Compressible Web / rank @@
+Normal rank
@@ Property / cites work @@
+On the maximum betweenness improvement problem
@@ Property / cites work: On the maximum betweenness improvement problem / rank @@
+Normal rank
@@ Property / cites work @@
+Using shortcut edges to maximize the number of triangles in graphs
+Normal rank
@@ Property / cites work @@
+Minimizing the Diameter of a Network Using Shortcut Edges
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Augmenting graphs to minimize the diameter
@@ Property / cites work: Augmenting graphs to minimize the diameter / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Better Approximation of Betweenness Centrality
@@ Property / cites work: Better Approximation of Betweenness Centrality / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for updating betweenness centrality in fully dynamic graphs
+Normal rank
@@ Property / cites work @@
+Minimizing Average Shortest Path Distances via Shortcut Edge Addition
+Normal rank
@@ Property / cites work @@
+Q4149262
@@ Property / cites work: Q4149262 / rank @@
+Normal rank
@@ Property / cites work @@
+Betweenness Centrality – Incremental and Faster
@@ Property / cites work: Betweenness Centrality – Incremental and Faster / rank @@
+Normal rank
@@ Property / cites work @@
+An analysis of approximations for maximizing submodular set functions—I
+Normal rank
@@ Property / cites work @@
+On the approximability of the link building problem
+Normal rank
@@ Property / cites work @@
+Fully Dynamic Betweenness Centrality
@@ Property / cites work: Fully Dynamic Betweenness Centrality / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity of dynamic graph problems
+Normal rank
@@ Property / cites work @@
+Fast approximation of betweenness centrality through sampling
+Normal rank
@@ Property / cites work @@
+The Design of Approximation Algorithms
@@ Property / cites work: The Design of Approximation Algorithms / rank @@
+Normal rank