ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2001.08108
  4. Cited By
Simple and Fast Distributed Computation of Betweenness Centrality

Simple and Fast Distributed Computation of Betweenness Centrality

IEEE Conference on Computer Communications (INFOCOM), 2020
22 January 2020
P. Crescenzi
Pierre Fraigniaud
A. Paz
ArXiv (abs)PDFHTML

Papers citing "Simple and Fast Distributed Computation of Betweenness Centrality"

1 / 1 papers shown
Title
A Survey of Distributed Graph Algorithms on Massive Graphs
A Survey of Distributed Graph Algorithms on Massive Graphs
Lingkai Meng
Yu Shao
Long Yuan
Longbin Lai
Peng Cheng
Xue Li
Wenyuan Yu
Wenjie Zhang
Xuemin Lin
Jingren Zhou
185
28
0
09 Apr 2024
1