athomo / kcoreLinks
☆12Updated 7 years ago
Alternatives and similar repositories for kcore
Users that are interested in kcore are comparing it to the libraries listed below
Sorting:
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 6 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆158Updated last year
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Updated 7 years ago
- CoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms (ICDM'16 & KAIS'18)☆16Updated 8 months 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
- A general-purpose, distributed graph random walk engine.☆109Updated last year
- Dynamic data structure for sparse graphs.☆29Updated last year
- DenseAlert: Incremental Dense-SubTensor Detection in Tensor Streams (KDD'17)☆19Updated 8 months ago
- DynaMo: Dynamic Community Detection by Incrementally Maximizing Modularity☆29Updated 3 years ago
- FORA: Simple and Effective Approximate Single-Source Personalized Pagerank☆31Updated 4 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆54Updated 7 years ago
- ☆143Updated 4 years ago
- Graph Partitoning Using Graph Convolutional Networks☆65Updated 3 years ago
- Algorithms to list k-cliques in real-world graphs☆26Updated 4 years ago
- Differentiated Computation and Partitioning on Skewed (Natural or Bipartite) Graphs☆66Updated 3 years ago
- GBBS: Graph Based Benchmark Suite☆211Updated 7 months ago
- Graph edge partitioning algorithms☆46Updated 5 years ago
- This is a sample implementation of "Asymmetric Transitivity Preserving Graph Embedding"(KDD 2016).☆17Updated 7 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Updated 3 years ago
- ☆51Updated 8 years ago
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆162Updated 4 years ago
- Code, datasets & supplementary for "Structural Patterns and Generative Models of Real-world Hypergraphs"☆31Updated 8 months ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆28Updated 2 years ago
- This repository contains research into the use of graph partitioning algorithms for assigning people shelters based on their social netwo…☆18Updated 6 years ago
- Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"☆54Updated 11 months ago
- ☆16Updated 4 years ago
- Experimental Setup for Performance Analysis of Streaming Algorithms☆31Updated 3 years ago
- ☆13Updated 7 years ago
- Trillion-edge Scale Graph Edge Partitioning☆27Updated 5 years ago