Back to Results
First PageMeta Content
Network theory / Graph theory / Graph connectivity / Networks / Edsger W. Dijkstra / Centrality / Betweenness centrality / Shortest path problem / Randomized algorithm / Connected component / Line graph


XX ABRA: Approximating Betweenness Centrality in Static and Dynamic Graphs with Rademacher Averages MATTEO RIONDATO, Two Sigma Investments, LP ELI UPFAL, Brown University
Add to Reading List

Document Date: 2016-07-30 12:22:15


Open Document

File Size: 859,56 KB

Share Result on Facebook