graph-sparsifier
| Crates.io | graph-sparsifier |
| lib.rs | graph-sparsifier |
| version | 0.1.1 |
| created_at | 2025-03-15 03:58:25.073477+00 |
| updated_at | 2025-03-18 15:50:25.367289+00 |
| description | A graph sparsifier based on an approximated PageRank algorithm. |
| homepage | |
| repository | https://github.com/TimeExceed/graph-sparsifier |
| max_upload_size | |
| id | 1593187 |
| size | 78,783 |
Taoda (TimeExceed)
documentation
README
A Graph Sparsifier
This is a graph sparsifier, which splits an undirected graph into high cohesion, low coupling components. It is based on an approximated PageRank algorithm introduced in
Detecting sharp drops in PageRank and a simplified local partitioning algorithm by Reid Andersen and Fan Chung