ahollocou / graph-streamingLinks
A streaming algorithm for graph clustering
☆12Updated 7 years ago
Alternatives and similar repositories for graph-streaming
Users that are interested in graph-streaming are comparing it to the libraries listed below
Sorting:
- A Parallel Graphlet Decomposition Library for Large Graphs☆89Updated 6 years ago
- A software package for one-pass Vertex-cut balanced Graph Partitioning.☆32Updated 10 years ago
- A general-purpose, distributed graph random walk engine.☆109Updated 2 years ago
- GraMi is a novel framework for frequent subgraph mining in a single large graph, GraMi outperforms existing techniques by 2 orders of ma…☆117Updated last year
- WebGraph framework with extensions☆23Updated 10 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆160Updated last year
- NetworkX Addon to allow graph partitioning with METIS☆79Updated 2 years ago
- KDD Course Project - Implementation of Community Detection Algorithms and Evaluations and Some Datasets (港科博一时候KDD课程作业) - by Shixuan Sun …☆42Updated 7 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆55Updated 8 years ago
- ☆12Updated 8 years ago
- Graph edge partitioning algorithms☆47Updated 6 years ago
- Market Survey: Community Detection☆70Updated 8 years ago
- ☆18Updated 4 years ago
- Source code and datasets of "An In-Depth Study of Continuous Subgraph Matching", accepted by VLDB'22 - By Xibo Sun, Dr. Shixuan Sun, Prof…☆50Updated 2 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- ☆144Updated 4 years ago
- CPAM: Compressed Parallel Augmented Maps☆25Updated 2 months ago
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆163Updated 4 years ago
- DynaMo: Dynamic Community Detection by Incrementally Maximizing Modularity☆29Updated 4 years ago
- An implementation of "EdMot: An Edge Enhancement Approach for Motif-aware Community Detection" (KDD 2019)☆133Updated 2 years ago
- Graph Challenge☆32Updated 6 years ago
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Updated 7 years ago
- ☆13Updated 9 years ago
- Experimental Setup for Performance Analysis of Streaming Algorithms☆32Updated 3 years ago
- FORA: Simple and Effective Approximate Single-Source Personalized Pagerank☆32Updated 4 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Updated 3 years ago
- A scalable implementation of "Learning Structural Node Embeddings Via Diffusion Wavelets (KDD 2018)".☆187Updated 2 years ago
- OpenMP-based parallel software for computing the truss decomposition of a graph.☆14Updated 7 years ago
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆69Updated 2 years ago
- Code for the paper titled "Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins". VLDB'19☆33Updated 5 months ago