☆16Apr 2, 2024Updated 2 years ago
Alternatives and similar repositories for VEQ_S
Users that are interested in VEQ_S are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach (Submitted to VLDB 2024)☆11Dec 23, 2024Updated last year
- ☆12Oct 18, 2023Updated 3 years ago
- Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming☆11Feb 12, 2026Updated 9 months ago
- ☆14Aug 5, 2021Updated 5 years ago
- Graph Analysis Library for directed and undirected simple graph☆21Apr 18, 2023Updated 3 years ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- The source code of "A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction"☆17Sep 6, 2024Updated 2 years ago
- Implementation of GuP [Arai+ SIGMOD'23]☆10Jan 10, 2024Updated 2 years ago
- ☆14Aug 14, 2024Updated 2 years ago
- Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together☆73Feb 18, 2022Updated 4 years ago
- Released code for [sigmod'21] A learned Sketch for Subgraph Counting☆22Sep 26, 2021Updated 5 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆166Oct 26, 2023Updated 3 years ago
- batch-backtracking subgraph matching☆10Oct 22, 2026Updated 3 weeks ago
- Algorithms to list k-cliques in real-world graphs☆24Mar 4, 2021Updated 5 years ago
- a k-cliques algorithm☆19Nov 18, 2021Updated 5 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.
- NewSP: A New Search Process for Continuous Subgraph Matching over Dynamic Graphs[ICDE 24]☆16Oct 10, 2024Updated 2 years ago
- Source code of "RapidFlow: An Efficient Approach to Continuous Subgraph Matching" published in VLDB'2022 - By Shixuan Sun, Xibo Sun, Bing…☆32Jun 30, 2022Updated 4 years ago
- Turn web versions of ChatGPT, Claude, and Gemini into MCP tools for your AI IDE. (将网页版 ChatGPT、Claude 和 Gemini 转化为 IDE 可调用的 MCP 工具。)☆17Apr 6, 2026Updated 7 months ago
- Benchmarking for factorized processing☆11Jul 5, 2021Updated 5 years ago
- taeguk's vim settings☆12Mar 26, 2016Updated 10 years ago
- A fork of Sebastian Nowozin's and Koji Tsuda's gboost code☆16Mar 5, 2013Updated 13 years ago
- Codes of the paper "Time Constrained Continuous Subgraph Search Over Streaming Graphs. ICDE 2019: 1082-1093". Authors: Youhuan Li, Lei Zo…☆13Jun 18, 2021Updated 5 years ago
- Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins (PVLDB 2019)☆33Apr 25, 2025Updated last year
- ☆10Nov 28, 2023Updated 2 years ago
- Simple, predictable pricing with DigitalOcean hosting • AdAlways know what you'll pay with monthly caps and flat pricing. Enterprise-grade infrastructure trusted by 600k+ customers.
- Source code and datasets of "RapidMatch: A Holistic Approach to Subgraph Query Processing", accepted by VLDB'21 - By Shixuan Sun, Xibo Su…☆38Aug 10, 2022Updated 4 years ago
- Undergraduate Operating Systems course (2019 fall)☆17Nov 21, 2019Updated 6 years ago
- ☆13Mar 20, 2023Updated 3 years ago
- 吴恩达Coursera课程《机器学习》课后作业代码&笔记☆17Mar 9, 2019Updated 7 years ago
- ☆14Aug 7, 2019Updated 7 years ago
- Official Core Services for MemFuse - the lightning-fast open-source memory layer that gives LLMs persistent, queryable memory across conv…☆25Oct 13, 2025Updated last year
- Download accepted solutions from Codeforces for any username☆12Jan 5, 2021Updated 5 years ago
- A subgraph enumeration framework☆14Oct 20, 2017Updated 9 years ago
- SARVLM: A Vision-Language Model for SAR Imagery and the SARVLM-1M Dataset☆19Apr 14, 2026Updated 7 months ago
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- Maximum clique computation over large sparse graphs☆24Mar 19, 2022Updated 4 years ago
- Code for "Efficiently Counting Substructures by Subgraph GNNs without Running GNN on Subgraphs"☆10May 20, 2024Updated 2 years ago
- ☆14Oct 22, 2026Updated 3 weeks ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆18Nov 24, 2018Updated 7 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆25Apr 24, 2022Updated 4 years ago
- 2019F Programming Language Homework Checker☆10Nov 28, 2019Updated 6 years ago
- Deep Multi-Graph Clustering via Attentive Cross-Graph Association☆25Apr 6, 2020Updated 6 years ago
Are these results useful?