usc-cloud / parallel-high-betweenness-centralityLinks
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
Sorting:
- SNAP repository for Ringo☆14Updated 7 years ago
- SmallK: very fast data clustering tools☆14Updated 6 years ago
- Library of graph algorithms for Apache Giraph.☆8Updated 9 years ago
- graph-based substructure pattern mining algorithm (authors: Xifeng Yan, Jiawei Han) implementation☆11Updated 8 years ago
- USC GoFFish Graph Analytics Framework☆33Updated 10 years ago
- Next generation graph processing platform☆12Updated 8 years ago
- A vertex-centric CUDA/C++ API for large graph analytics on GPUs using the Gather-Apply-Scatter abstraction☆23Updated 11 years ago
- DimmWitted Gibbs Sampler in C++ — ⚠️🚧🛑 REPO MOVED TO DEEPDIVE 👉🏿☆17Updated 8 years ago
- For benchmaring community detection algorithms on social networks with meta-data☆17Updated 10 years ago
- A parallel packed CSR data structure for large-scale dynamic graphs☆14Updated 2 years ago
- Python Benchmarking Framework for the Clustering Algorithms Evaluation: networks generation and shuffling; failover execution and resourc…☆19Updated 6 years ago
- ☆21Updated 9 years ago
- Dynamic Community Finding☆26Updated 7 years ago
- Implementation of netsimile Algorithm to detect anomalies in time series graphs.☆10Updated 10 years ago
- Community Detection for Twitter follower network of 40 million users using mapreduce☆16Updated 14 years ago
- Code and data for paper PReP: Path-Based Relevance from a Probabilistic Perspective in Heterogeneous Information Networks☆16Updated 7 years 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
- A framework for evaluating community mining algorithms.☆11Updated 9 years ago
- CoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms (ICDM'16 & KAIS'18)☆16Updated 7 months ago
- Multilinear PageRank☆15Updated 8 years ago
- Dynamic PageRank☆16Updated 9 years ago
- Infinite relational model (IRM) for datamicroscopes☆14Updated 9 years ago
- Network Representation Learning with Rich Text Information (IJCAI 2015)☆47Updated 8 years ago
- Map Reduce Implementation of a community detection algorithm extending Louvain method for community detection.☆15Updated 9 years ago
- Fast and Scalable Method for Distributed Boolean Tensor Factorization (ICDE'17 & VLDBJ'19)☆6Updated 6 years ago
- Tuffy, a Markov Logic Network solver☆25Updated 10 years ago
- Graph Mining Using SPARQL☆21Updated 9 years ago
- ☆20Updated 8 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- M-Zoom: Fast Dense-Block Detection in Tensors with Quality Guarantees (ECML/PKDD'16 & TKDD'18)☆27Updated 7 months ago