MiviaLab / vf3lib
VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs
☆120Updated 2 years ago
Alternatives and similar repositories for vf3lib:
Users that are interested in vf3lib are comparing it to the libraries listed below
- VF2 - Subgraph Isomorphism☆45Updated 4 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆150Updated last year
- Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"☆53Updated 7 months ago
- Subgraph matching and isomorphisms in Python.☆27Updated 2 years ago
- ☆12Updated 4 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…☆47Updated last year
- ☆348Updated 8 months ago
- GraMi is a novel framework for frequent subgraph mining in a single large graph, GraMi outperforms existing techniques by 2 orders of ma…☆111Updated last year
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆24Updated 2 years ago
- An easily extensible C++ library for (suboptimally) computing the graph edit distance between attributed graphs.☆59Updated last year
- The source code of "A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction"☆10Updated 5 months ago
- Released code for [sigmod'21] A learned Sketch for Subgraph Counting☆18Updated 3 years ago
- A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs☆27Updated 9 years ago
- Exact graph edit distance (GED) computation and verification☆55Updated 2 years ago
- Implementation of paper "D2Match: Leveraging Deep Learning and Degeneracy for Subgraph Matching"☆12Updated last year
- Ullman Algorithm - An Algorithm for Subgraph Isomorphism☆27Updated last year
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- Source code for our AAAI paper "Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks".☆187Updated 2 years ago
- ☆134Updated last year
- Graph Partitoning Using Graph Convolutional Networks☆65Updated 2 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 5 years ago
- Code for the KDD 2021 paper "Scaling Up Graph Neural Networks Via Graph Coarsening"☆27Updated 8 months ago
- Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.☆200Updated 4 years ago
- Multilevel graph coarsening algorithm with spectral and cut guarantees☆87Updated 4 years ago
- Trillion-edge Scale Graph Edge Partitioning☆27Updated 5 years ago
- ☆148Updated 5 years ago
- ☆13Updated 3 years ago
- ☆26Updated 2 years ago
- ☆94Updated 2 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…☆43Updated 2 years ago