usc-cloud / parallel-high-betweenness-centrality
MPI based algorithm for detecting high centrality vertices in large graphs
☆8Updated 10 years ago
Alternatives and similar repositories for parallel-high-betweenness-centrality:
Users that are interested in parallel-high-betweenness-centrality are comparing it to the libraries listed below
- DimmWitted Gibbs Sampler in C++ — ⚠️🚧🛑 REPO MOVED TO DEEPDIVE 👉🏿☆17Updated 8 years ago
- SmallK: very fast data clustering tools☆14Updated 5 years ago
- SNAP repository for Ringo☆14Updated 7 years ago
- Library of graph algorithms for Apache Giraph.☆8Updated 9 years ago
- Python Benchmarking Framework for the Clustering Algorithms Evaluation: networks generation and shuffling; failover execution and resourc…☆19Updated 6 years ago
- graph-based substructure pattern mining algorithm (authors: Xifeng Yan, Jiawei Han) implementation☆11Updated 7 years ago
- Low-level primitives for collapsed Gibbs sampling in python and C++☆33Updated 10 months ago
- ☆21Updated 9 years ago
- DEMON: a local-first discovery method for overlapping communities.☆35Updated 11 months ago
- The STINGER in-memory graph store and dynamic graph analysis platform. Millions to billions of vertices and edges at thousands to millio…☆11Updated 9 years ago
- Implementation of the fastPFP approximate subgraph matching algorithm, as described in http://arxiv.org/abs/1207.1114☆11Updated 9 years ago
- Dynamic PageRank☆16Updated 9 years ago
- USC GoFFish Graph Analytics Framework☆33Updated 10 years ago
- Map Reduce Implementation of a community detection algorithm extending Louvain method for community detection.☆15Updated 9 years ago
- Nonparametric Active Sampling☆11Updated 6 years ago
- A vertex-centric CUDA/C++ API for large graph analytics on GPUs using the Gather-Apply-Scatter abstraction☆23Updated 10 years ago
- Local community detection code that implements the methods used in Think Locally, Act Locally: The Detection of Small, Medium-Sized, and …☆13Updated 6 years ago
- Personalized PageRank Algorithm described in the paper "FAST-PPR: Scaling Personalized PageRank Estimation for Large Graphs"☆35Updated 10 years ago
- Multilinear PageRank☆15Updated 7 years ago
- The implementation for maximum clique enumeration algorithm☆11Updated 8 years ago
- Formal concept analysis lattice generation and query in Python☆13Updated 10 years ago
- Run large scale tensor and coupled matrix-tensor factorization on top of stock Hadoop.☆18Updated 7 years ago
- Pattern-of-Behavior Search Tool☆11Updated 2 years ago
- Multi-Graph Multi-Label Learning☆11Updated 6 years ago
- ☆15Updated 6 years ago
- Frequent subgraph mining using FFSM algorithm, C++☆11Updated 7 years ago
- For benchmaring community detection algorithms on social networks with meta-data☆17Updated 10 years ago
- Alchemist: an Apache Spark<->MPI interface☆26Updated 6 years ago
- MPI based distributed memory implementation of Louvain method for non overlapping community detecction☆28Updated 10 years ago
- Fast and Scalable Method for Distributed Boolean Tensor Factorization (ICDE'17 & VLDBJ'19)☆6Updated 5 years ago