Parallel Algorithm for Incremental Betweenness Centrality on Large Graphs

@article{Jamour2018ParallelAF,
  title={Parallel Algorithm for Incremental Betweenness Centrality on Large Graphs},
  author={Fuad Jamour and Spiros Skiadopoulos and Panos Kalnis},
  journal={IEEE Transactions on Parallel and Distributed Systems},
  year={2018},
  volume={29},
  pages={659-672}
}
Betweenness centrality quantifies the importance of nodes in a graph in many applications, including network analysis, community detection and identification of influential users. Typically, graphs in such applications evolve over time. Thus, the computation of betweenness centrality should be performed incrementally. This is challenging because updating even a single edge may trigger the computation of all-pairs shortest paths in the entire graph. Existing approaches cannot scale to large… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 38 REFERENCES

Similar Papers

Loading similar papers…