GraphChi
From MaRDI portal
Cited in
(16)- An efficient Monte Carlo approach to compute PageRank for large graphs on a single PC
- Fast construction of compressed web graphs
- MCSTL
- STXXL
- ANF
- Graphs
- GraphLab
- Pregel
- PEGASUS
- GRECS
- BUbiNG
- WebGraph
- Ligra
- \textsc{OCam}: out-of-core coordinate descent algorithm for matrix completion
- Computing source-to-target shortest paths for complex networks in RDBMS
- I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs
This page was built for software: GraphChi