All Stories

  1. Efficient Tracking of Communities on Evolving Graphs with Leiden Algorithm
  2. νMG-LPA and νBM-LPA: Memory Efficient GPU-based Label Propagation Algorithms (LPA) for Community Detection
  3. Community-Aware Network Dismantling via Gateways: Large-Scale Evaluation on LFR Benchmarks
  4. GVE-LPA and GSL-LPA: High-speed and internally-connected label propagation on multicore systems
  5. GPU-Accelerated Dynamic Frontier PageRank
  6. Towards Dynamic Community Detection with Leiden Algorithm
  7. ν-LPA: Fast GPU-based Label Propagation Algorithm (LPA) for Community Detection
  8. High-Speed Neighborhood-Based Link Prediction by Disregarding Large Hubs
  9. GVE-LPA: Fast Label Propagation Algorithm (LPA) for Community Detection in the Shared Memory Setting
  10. GVEL: Fast Graph Loading in Edgelist and Compressed Sparse Row (CSR) Formats
  11. High-Performance Implementation of Louvain Algorithm with Representational Optimizations
  12. Parallel Multicore Algorithms for Community Detection in Dynamic Graphs
  13. EvolvGraph: A Tool for Property-Constrained Generation of Dynamic Graphs †
  14. A Fast Parallel Approach for Neighborhood‐Based Link Prediction by Disregarding Large Hubs
  15. A Fast Graph Clustering Algorithm for Multicore CPUs
  16. Shared-Memory Parallel Algorithms for Community Detection in Dynamic Graphs
  17. Shared-Memory Parallel Dynamic Louvain Algorithm for Community Detection
  18. Lock-free Computation of PageRank in Dynamic Graphs
  19. An Approach for Addressing Internally-Disconnected Communities in Louvain Algorithm
  20. Efficient Gpu Implementation of Static and Incrementally Expanding Df-P Pagerank for Dynamic Graphs
  21. Gsl-Lpa: Fast Label Propagation Algorithm (Lpa) for Community Detection with No Internally-Disconnected Communities
  22. DF* PageRank: Incrementally Expanding Approaches for Updating PageRank on Dynamic Graphs
  23. Dynamic Batch Parallel Algorithms for Updating PageRank