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