-
Updated
Jun 24, 2024 - Cuda
subgraph-matching
Here are 18 public repositories matching this topic...
Approximate Subgraph Matching on Large, Dynamic Graphs.
-
Updated
May 20, 2024 - Python
Running benchmarks (BI 3/4/10/11/13/14) of LDBC-SNB via VEQ algorithm
-
Updated
Mar 10, 2024 - Jupyter Notebook
Python and LaTeX code for my master's thesis on the topic "Complexity and Algorithms for Weighted Subgraphs"
-
Updated
Mar 23, 2024 - TeX
in-depth analysis and comparison of eight leading in-memory subgraph matching algorithms, QuickSI, GraphQL, CFL, CECI, DP-iso, RI, and VF2++.
-
Updated
Dec 9, 2023 - Makefile
In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
-
Updated
Oct 26, 2023 - C++
Source code and datasets of "Efficient GPU-Accelerated Subgraph Matching", accepted by SIGMOD'23 - By Xibo Sun and Prof. Qiong Luo
-
Updated
Jul 20, 2023 - Cuda
Neural Subgraph Matching Paper: "AEDNet: Adaptive Edge-Deleting Network For Subgraph Matching". [Neural-Subgraph-Matching Method For Learning-Subgraph-Matching. (Approximate Subgraph matching, SubgraphMatching)]
-
Updated
Jun 25, 2023 - Python
Source code and datasets of "An In-Depth Study of Continuous Subgraph Matching", accepted by VLDB'22 - By Xibo Sun, Dr. Shixuan Sun, Prof. Qiong Luo, and Prof. Bingsheng He
-
Updated
Mar 16, 2023 - C++
Source code of "RapidFlow: An Efficient Approach to Continuous Subgraph Matching" published in VLDB'2022 - By Shixuan Sun, Xibo Sun, Bingsheng He and Qiong Luo
-
Updated
Jun 30, 2022 - C++
This repository contains a JavaScript algorithm designed to compare two graphs and identify the largest subgraph while calculating its critical path. Developed as a project for a course in my master's program, this project delves into discrete structures and graph theory, offering practical insights into graph analysis and optimization
-
Updated
Feb 20, 2022 - JavaScript
C++ (Boost) implementation of Subgraph retrieval from given set of graphs
-
Updated
Oct 28, 2021 - C++
This is the code of "Locality Sensitive Hashing for Optimizing Subgraph Query Processing in Parallel Computing System".
-
Updated
Jul 19, 2021 - C++
Source Code: Sub-GMN: Subgraph Matching Network
-
Updated
Jun 24, 2021 - Python
Distributed Subgraph Enumeration via Backtracking-based Framework
-
Updated
Jan 22, 2021 - Java
The repo lists papers of various areas, including Graph Analytics, Graph Acceleration, Subgraph Matching, Streaming Graph Management, Worst-case Optimal Join Algorithms, Join Plan Optimization, and so on.
-
Updated
Oct 18, 2020
Crystal is a novel method for distributed subgraph matching on very large graphs. Crystal outperforms existing methods by several orders of magnitude on very large graphs. The work was published on VLDB 2018 with title "Subgraph matching: on compression and computation".
-
Updated
Nov 27, 2018 - Java
Improve this page
Add a description, image, and links to the subgraph-matching topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the subgraph-matching topic, visit your repo's landing page and select "manage topics."