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:
- FORA: Simple and Effective Approximate Single-Source Personalized Pagerank☆31Updated 4 years ago
- DenseAlert: Incremental Dense-SubTensor Detection in Tensor Streams (KDD'17)☆19Updated 7 months ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆157Updated last year
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 6 years ago
- ☆14Updated 3 years ago
- DynaMo: Dynamic Community Detection by Incrementally Maximizing Modularity☆28Updated 3 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Updated 3 years ago
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Updated 7 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- CoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms (ICDM'16 & KAIS'18)☆16Updated 7 months ago
- Dynamic data structure for sparse graphs.☆30Updated last year
- Local Community Detection in Multiple Netwrks☆14Updated 3 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
- Algorithms to list k-cliques in real-world graphs☆26Updated 4 years ago
- A general-purpose, distributed graph random walk engine.☆110Updated last year
- Experimental Setup for Performance Analysis of Streaming Algorithms☆31Updated 3 years ago
- ☆18Updated 3 years ago
- Distributed Graph Mining on a Massive "Single" Graph☆15Updated 5 years ago
- ☆142Updated 4 years ago
- Parallel Frequent Subgraph Mining☆31Updated 7 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- Subgraph matching and isomorphisms in Python.☆27Updated 2 years ago
- Graph edge partitioning algorithms☆46Updated 5 years ago
- Maximum clique computation over large sparse graphs☆21Updated 3 years ago
- The SEMB library is an easy-to-use tool for getting and evaluating structural node embeddings in graphs.☆18Updated 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…☆113Updated last year
- Code for the paper titled "Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins". VLDB'19☆32Updated 2 months ago
- The code of APP, Scalable Graph Embedding for Asymmetric Proximity. Zhou, Chang and Liu, Yuqiong and Liu, Xiaofei and Liu, Zhongyi and Ga…☆10Updated 6 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆27Updated 2 years ago
- Code, datasets & supplementary for "Structural Patterns and Generative Models of Real-world Hypergraphs"☆31Updated 7 months ago