cwpearson
commented
5 years ago | Operation | pangolin | cugraph | |
|---|---|---|---|
| K-truss | Single-gpu | ||
| PageRank | Single-GPU | ||
| Jaccard Similarity | Single-GPU | ||
| Weighted Jaccard | Single-GPU | ||
| Overlap Similarity | Single-GPU | ||
| SSSP | Single-GPU | ||
| All-pairs SP | |||
| BSF | Single-GPU | ||
| Triangle Counting | multi-gpu | Single-GPU | |
| Subgraph Extraction | Single-GPU | ||
| Spectral Clustering - Balanced-Cut | Single-GPU | ||
| Spectral Clustering - Modularity Maximization | Single-GPU | ||
| Louvain | Single-GPU | ||
| Renumbering | Single-GPU | ||
| Basic Graph Statistics | Single-GPU | ||
| triad census | |||
| sparse NN | |||
| cross-decomposition |
- Minimum Cut - for finding the connectivity
- Undirected: Karger's Algorithm?
- All-Pairs shortest Path - for finding the graph diameter
- BFS/ DFS from all vertices, then find maximum of shortest paths
- Floyd-Warshall
- Johnson's Algorithm