The source code of "A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction"
☆17Sep 6, 2024Updated last year
Alternatives and similar repositories for SubgraphMatchingSurvey
Users that are interested in SubgraphMatchingSurvey are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Source code and datasets of "An In-Depth Study of Continuous Subgraph Matching", accepted by VLDB'22 - By Xibo Sun, Dr. Shixuan Sun, Prof…☆52Mar 16, 2023Updated 3 years ago
- Implementation of GuP [Arai+ SIGMOD'23]☆10Jan 10, 2024Updated 2 years ago
- ☆19Jan 18, 2026Updated 6 months ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆167Oct 26, 2023Updated 2 years ago
- Source code and datasets of "Efficient GPU-Accelerated Subgraph Matching", accepted by SIGMOD'23 - By Xibo Sun and Prof. Qiong Luo☆20Jul 20, 2023Updated 3 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆18Nov 24, 2018Updated 7 years ago
- Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming☆11Feb 12, 2026Updated 5 months ago
- Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together☆73Feb 18, 2022Updated 4 years ago
- ☆13Mar 24, 2025Updated last year
- GPU-friendly Subgraph Isomorphism, published in ICDE 2020☆37Jul 30, 2025Updated 11 months ago
- Codes of the paper "Time Constrained Continuous Subgraph Search Over Streaming Graphs. ICDE 2019: 1082-1093". Authors: Youhuan Li, Lei Zo…☆12Jun 18, 2021Updated 5 years ago
- ☆11Nov 14, 2023Updated 2 years ago
- A graph pattern mining framework for large graphs on gpu.☆16Dec 9, 2024Updated last year
- ☆10Jul 6, 2021Updated 5 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- This is the official implementation of the ICML 2023 paper - Can Forward Gradient Match Backpropagation ?☆13May 31, 2023Updated 3 years ago
- Maximum clique computation over large sparse graphs☆24Mar 19, 2022Updated 4 years ago
- Source code for "Taming GANs with Lookahead–Minmax", ICLR 2021.☆15Mar 28, 2021Updated 5 years ago
- Algorithms to list k-cliques in real-world graphs☆25Mar 4, 2021Updated 5 years ago
- Model Doctor: A Simple Gradient Aggregation Strategy for Diagnosing and Treating CNN Classifiers [https://arxiv.org/pdf/2112.04934.pdf]☆15May 13, 2023Updated 3 years ago
- This is the implementation of the Hierarquical Clustering-based Nearest Neighbor Graphs☆22Feb 6, 2020Updated 6 years ago
- High-performance graph processing on hybrid CPU-GPU platforms by using dynamic load-balancing☆12Sep 15, 2016Updated 9 years ago
- Implementations of the algorithms described in the paper: On the Convergence Theory for Hessian-Free Bilevel Algorithms.☆11Nov 1, 2024Updated last year
- Benchmark for filtered ANN search applications☆25Apr 28, 2026Updated 2 months ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- ☆13Nov 20, 2015Updated 10 years ago
- Experiments with Super-Universal Newton method.☆13Aug 12, 2022Updated 3 years ago
- This code base represents "faimGraph: High Performance Management of Fully-dynamic Graphs under tight Memory Constraints on the GPU"☆16Apr 23, 2021Updated 5 years ago
- [ICLR 2025] This repository contains the code to reproduce the results from our paper From Sparse Dependence to Sparse Attention: Unveili…☆12Mar 7, 2025Updated last year
- Streaming Graph Server with partitioning☆15Aug 17, 2023Updated 2 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆25Apr 24, 2022Updated 4 years ago
- An easily extensible C++ library for (suboptimally) computing the graph edit distance between attributed graphs.☆66Jun 22, 2023Updated 3 years ago
- Source codes of "Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction", SIGMOD 2023☆14Sep 7, 2023Updated 2 years ago
- RISC-V SingleCycle/Pipeline CPU (lab of ZJU Computer System Series)☆16Jul 6, 2023Updated 3 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Exact graph edit distance (GED) computation and verification☆70Sep 6, 2022Updated 3 years ago
- ZOSVRG-BlackBox-Adv☆12Oct 30, 2018Updated 7 years ago
- Deep Multi-Graph Clustering via Attentive Cross-Graph Association☆25Apr 6, 2020Updated 6 years ago
- a k-cliques algorithm☆19Nov 18, 2021Updated 4 years ago
- ☆12Sep 11, 2022Updated 3 years ago
- A benchmark suite for Graph Machine Learning☆19Oct 8, 2024Updated last year
- Parallel Frequent Subgraph Mining☆30Nov 18, 2017Updated 8 years ago