Algorithms for WebGraph

Algorithms for the Rust implementation of the WebGraph framework for graph compression.

Algorithms

Graph Structure

• Strongly Connected Components (SCCs): Tarjan's algorithm and Kosaraju's algorithm for computing SCCs in directed graphs; sequential and parallel computation of connected components for symmetric graphs
• Topological Sorting: Orders vertices of a directed acyclic graph
• Acyclicity Testing: Checks if a graph is acyclic

Distance Computation

• HyperBall: Probabilistic algorithm for computing distances, closeness centrality, and other measures using HyperLogLog counters
• ExactSumSweep: Exact computation of eccentricities, radius, and diameter

Community Detection

• Layered Label Propagation (LLP): Fast community detection algorithm for large graphs

Ranking

• PageRank: Fast parallel computation of PageRank.

CLI Integration

Many algorithms can also be accessed through the command-line interface.

Acknowledgments

This software has been partially supported by project SERICS (PE00000014) under the NRRP MUR program funded by the EU - NGEU, and by project ANR COREGRAPHIE, grant ANR-20-CE23-0002 of the French Agence Nationale de la Recherche. Views and opinions expressed are however those of the authors only and do not necessarily reflect those of the European Union or the Italian MUR. Neither the European Union nor the Italian MUR can be held responsible for them.