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
Sorting:
- graph-based substructure pattern mining algorithm (authors: Xifeng Yan, Jiawei Han) implementation☆11Updated 7 years ago
- A vertex-centric CUDA/C++ API for large graph analytics on GPUs using the Gather-Apply-Scatter abstraction☆23Updated 11 years ago
- SNAP repository for Ringo☆14Updated 7 years ago
- Implementation of netsimile Algorithm to detect anomalies in time series graphs.☆10Updated 10 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
- MPI based distributed memory implementation of Louvain method for non overlapping community detecction☆28Updated 10 years ago
- Next generation graph processing platform☆12Updated 8 years ago
- Map Reduce Implementation of a community detection algorithm extending Louvain method for community detection.☆15Updated 9 years ago
- SmallK: very fast data clustering tools☆14Updated 6 years ago
- Implementation of the fastPFP approximate subgraph matching algorithm, as described in http://arxiv.org/abs/1207.1114☆11Updated 9 years ago
- Pattern-of-Behavior Search Tool☆11Updated 2 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
- OpenMP-based parallel software for computing the truss decomposition of a graph.☆14Updated 7 years ago
- Parallel Frequent Subgraph Mining☆31Updated 7 years ago
- CP 2015 subgraph isomorphism experiments, data and paper☆13Updated 9 years ago
- The ParSeMiS project (Parallel and Sequential Graph Mining Suite) searches for frequent, interesting substructures in graph databases. ht…☆44Updated 5 years ago
- OpenMP-based parallel program for counting the number of triangles in a sparse graph☆18Updated 7 years ago
- An implementation of the absorbing random-walk centrality☆14Updated 9 years ago
- Scraper built with Scrapy.☆17Updated 9 months ago
- Community Detection for Twitter follower network of 40 million users using mapreduce☆16Updated 14 years ago
- A Distributed RDF Data Management System for Processing SPARQL Queries Over Distributed RDF Graphs☆14Updated 2 years ago
- Dynamic PageRank☆16Updated 9 years ago
- ☆21Updated 8 years ago
- ROLL: Fast In-Memory Generation of Gigantic Scale-free Networks☆11Updated 8 years ago
- DimmWitted Gibbs Sampler in C++ — ⚠️🚧🛑 REPO MOVED TO DEEPDIVE 👉🏿☆17Updated 8 years ago
- Implementation of QuadSketch algorithm☆11Updated 2 years ago
- Frequent subgraph mining using FFSM algorithm, C++☆11Updated 7 years ago
- Library of graph algorithms for Apache Giraph.☆8Updated 9 years ago
- Finding statistically significant subgraphs while correcting for multiple testing☆8Updated 9 years ago