MiviaLab / vf3libLinks
VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs
☆129Updated 2 years ago
Alternatives and similar repositories for vf3lib
Users that are interested in vf3lib are comparing it to the libraries listed below
Sorting:
- VF2 - Subgraph Isomorphism☆46Updated 5 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆157Updated last year
- Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"☆54Updated 11 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
- ☆354Updated last year
- ☆14Updated 3 years ago
- ☆16Updated 7 months 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
- Subgraph matching and isomorphisms in Python.☆27Updated 2 years ago
- The source code of "A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction"☆13Updated 9 months ago
- An easily extensible C++ library for (suboptimally) computing the graph edit distance between attributed graphs.☆62Updated 2 years ago
- Released code for [sigmod'21] A learned Sketch for Subgraph Counting☆19Updated 3 years ago
- ☆27Updated 2 years ago
- ORbit Counting Algorithm☆38Updated 8 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 6 years ago
- A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs☆27Updated 9 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
- ☆138Updated last year
- A solver for subgraph isomorphism problems, based upon a series of papers by subsets of McCreesh, Prosser, and Trimble.☆82Updated this week
- A software package for one-pass Vertex-cut balanced Graph Partitioning.☆31Updated 9 years ago
- Multilevel graph coarsening algorithm with spectral and cut guarantees☆90Updated 5 years ago
- The code of paper LMC: Fast Training of GNNs via Subgraph Sampling with Provable Convergence. Zhihao Shi, Xize Liang, Jie Wang. ICLR 2023…☆47Updated 2 years ago
- Implementation of paper "D2Match: Leveraging Deep Learning and Degeneracy for Subgraph Matching"☆12Updated last year
- Largest realworld open-source graph dataset - Worked done under IBM-Illinois Discovery Accelerator Institute and Amazon Research Awards a…☆82Updated last week
- Trillion-edge Scale Graph Edge Partitioning☆27Updated 5 years ago
- ☆8Updated 3 years ago
- FORA: Simple and Effective Approximate Single-Source Personalized Pagerank☆31Updated 4 years ago
- GPU-friendly Subgraph Isomorphism, published in ICDE 2020☆33Updated last year
- Parallel Frequent Subgraph Mining☆31Updated 7 years ago