Efficient algorithms for updating betweenness centrality in fully dynamic graphs (Q1750422): Difference between revisions

@@ Property / cites work @@
+The university of Florida sparse matrix collection
+Normal rank
@@ Property / cites work @@
+Polygonal approximation of digital planar curves through vertex betweenness
+Normal rank
@@ Property / cites work @@
+Approximating Betweenness Centrality
@@ Property / cites work: Approximating Betweenness Centrality / 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 @@
+CENTRALITY ESTIMATION IN LARGE NETWORKS
@@ Property / cites work: CENTRALITY ESTIMATION IN LARGE NETWORKS / rank @@
+Normal rank
@@ Property / cites work @@
+A new approach to dynamic all pairs shortest paths
+Normal rank
@@ Property / cites work @@
+Experimental analysis of dynamic all pairs shortest path algorithms
+Normal rank
@@ Property / cites work @@
+Routing betweenness centrality
@@ Property / cites work: Routing betweenness centrality / rank @@
+Normal rank
@@ Property / cites work @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+Better Approximation of Betweenness Centrality
@@ Property / cites work: Better Approximation of Betweenness Centrality / rank @@
+Normal rank
@@ Property / cites work @@
+A Faster Algorithm to Update Betweenness Centrality after Node Alteration
+Normal rank
@@ Property / cites work @@
+CONGESTION AND CENTRALITY IN TRAFFIC FLOW ON COMPLEX NETWORKS
+Normal rank
@@ Property / cites work @@
+Network Analysis
@@ Property / cites work: Network Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-case update times for fully-dynamic all-pairs shortest paths
+Normal rank