On the public citation graph
Efficient GPU-Accelerated Subgraph Matching
0 signed · 68 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/s00778-021-00708-yopenalex-snapshot
Accelerating multi-way joins on the GPU
inferredcites →https://doi.org/10.1007/s10115-016-0968-2openalex-snapshot
Efficient and scalable labeled subgraph matching using SGMatch
inferredcites →https://doi.org/10.1109/icde.2019.00029openalex-snapshot
Efficient Parallel Subgraph Enumeration on a Single Machine
inferredcites →https://doi.org/10.1109/ipdps.2015.88openalex-snapshot
Efficient and Simplified Parallel Graph Processing over CPU and MIC
inferredcites →https://doi.org/10.1109/tkde.2016.2566618openalex-snapshot
Network Motif Discovery: A GPU Approach
inferredcites →https://doi.org/10.1109/tkde.2020.3035564openalex-snapshot
Exploiting Reuse for GPU Subgraph Enumeration
inferredcites →https://doi.org/10.1109/tpami.2004.75openalex-snapshot
A (sub)graph isomorphism algorithm for matching large graphs
inferredcites →https://doi.org/10.1109/tpds.2019.2910068openalex-snapshot
HitGraph: High-throughput Graph Processing Framework on FPGA
inferredcites →https://doi.org/10.1145/1567274.1567278openalex-snapshot
Semantics and complexity of SPARQL
inferredcites →https://doi.org/10.1145/1618452.1618500openalex-snapshot
Real-time parallel hashing on the GPU
inferredcites →https://doi.org/10.1145/2274576.2274578openalex-snapshot
Graph pattern matching revised for social network analysis
inferredcites →https://doi.org/10.1145/2588555.2588557openalex-snapshot
Parallel subgraph listing in a large-scale graph
inferredcites →https://doi.org/10.1145/2882903.2915236openalex-snapshot
Efficient Subgraph Matching by Postponing Cartesian Products
inferredcites →https://doi.org/10.1145/321921.321925openalex-snapshot
An Algorithm for Subgraph Isomorphism
inferredcites →https://doi.org/10.1145/3318464.3380581openalex-snapshot
In-Memory Subgraph Matching: An In-depth Study
inferredcites →https://doi.org/10.1145/3318464.3389699openalex-snapshot
GPU-Accelerated Subgraph Enumeration on Partitioned Graphs
inferredcites →https://doi.org/10.1145/3448016.3457265openalex-snapshot
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching
inferredcites →https://doi.org/10.1186/1471-2105-14-s7-s13openalex-snapshot
A subgraph isomorphism algorithm and its application to biochemical data
inferredcites →https://doi.org/10.14778/1453856.1453899openalex-snapshot
Taming verification hardness
inferredcites →https://doi.org/10.14778/1920841.1920887openalex-snapshot
On graph query optimization in large networks
inferredcites →https://doi.org/10.14778/2794367.2794368openalex-snapshot
Scalable subgraph enumeration in MapReduce
inferredcites →https://doi.org/10.14778/3021924.3021937openalex-snapshot
Scalable distributed subgraph enumeration
inferredcites →https://doi.org/10.14778/3184470.3184473openalex-snapshot
Distributed evaluation of subgraph queries using worst-case optimal low-memory dataflows
inferredcites →https://doi.org/10.14778/3199517.3199520openalex-snapshot
Distributed evaluation of subgraph queries using worst-case optimal low-memory dataflows
inferredcites →https://doi.org/10.14778/3229863.3229874openalex-snapshot
Real-time constrained cycle detection in large dynamic graphs
inferredcites →https://doi.org/10.14778/3342263.3342643openalex-snapshot
Optimizing subgraph queries by combining binary and worst-case optimal joins
inferredcites →https://doi.org/10.14778/3457390.3457395openalex-snapshot
Symmetric continuous subgraph matching with bidirectional dynamic programming
inferredcites →https://doi.org/10.14778/3523210.3523218openalex-snapshot
An in-depth study of continuous subgraph matching
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-981-92-5693-8_31openalex-snapshot
Efficient GPU-Based Continuous Subgraph Matching on Batch Updates
inferred← citeshttps://doi.org/10.1109/access.2025.3560405openalex-snapshot
Low-Power Subgraph Isomorphism at the Edge Using FPGAs
inferred← citeshttps://doi.org/10.1109/hpec62836.2024.10938454openalex-snapshot
VF2-PS: Parallel and Scalable Subgraph Monomorphism in Arachne
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00244openalex-snapshot
Faster Depth-First Subgraph Matching on GPUs
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00245openalex-snapshot
G2-AIMD: A Memory-Efficient Subgraph-Centric Framework for Efficient Subgraph Finding on GPUs
inferred← citeshttps://doi.org/10.1109/tkde.2025.3547443openalex-snapshot
GPU-Accelerated Structural Diversity Search in Graphs
inferred← citeshttps://doi.org/10.1109/tkde.2026.3718204openalex-snapshot
PGMiner: A Load-Aware Dynamic Graph Pattern Matching Approach on GPUs
inferred← citeshttps://doi.org/10.1109/tpds.2025.3639485openalex-snapshot
Enabling Tile-Based Direct Query on Adaptively Compressed Data With GPU Acceleration
inferred← citeshttps://doi.org/10.1145/3627673.3679101openalex-snapshot
Systems for Scalable Graph Analytics and Machine Learning: Trends and Methods
inferred← citeshttps://doi.org/10.1145/3637528.3671472openalex-snapshot
Systems for Scalable Graph Analytics and Machine Learning: Trends and Methods
inferred← citeshttps://doi.org/10.1145/3639288openalex-snapshot
gSWORD: GPU-accelerated Sampling for Subgraph Counting
inferred← citeshttps://doi.org/10.1145/3639315openalex-snapshot
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction
inferred← citeshttps://doi.org/10.1145/3661304.3661897openalex-snapshot
Understanding High-Performance Subgraph Pattern Matching: A Systems Perspective
inferred← citeshttps://doi.org/10.1145/3673038.3673134openalex-snapshot
A Distributed Framework for Subgraph Isomorphism Leveraging CPU and GPU Heterogeneous Computing
inferred← citeshttps://doi.org/10.1145/3725398openalex-snapshot
cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns
inferred← citeshttps://doi.org/10.1145/3725404openalex-snapshot
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
inferred← citeshttps://doi.org/10.1145/3769798openalex-snapshot
GraphTwin: Cache-Centric Bit-Level Graph Representation for Fast and Exact Graph Queries
inferred← citeshttps://doi.org/10.1145/3771286openalex-snapshot
GTSM: A multi-edge-centric temporal subgraph matching framework on GPUs
inferred← citeshttps://doi.org/10.1145/3786648openalex-snapshot
Enumerating Graph Pattern Matches with ML Oracles
inferred← citeshttps://doi.org/10.1145/3797905.3807860openalex-snapshot
HoloGraph: Bridging the Throughput Gap in Heterogeneous Graph Pattern Matching via Workload-Aware Steering
inferred← citeshttps://doi.org/10.1145/3802033openalex-snapshot
cuRPQ: A High-Performance GPU-Based Framework for Processing Regular and Conjunctive Regular Path Queries
inferred← citeshttps://doi.org/10.1145/3802064openalex-snapshot
Geld: Load-balanced D-Core Decomposition for Consumer GPUs
inferred← citeshttps://doi.org/10.14778/3704965.3704967openalex-snapshot
TenGraph: A Tensor-Based Graph Query Engine
inferred← citeshttps://doi.org/10.14778/3749646.3749693openalex-snapshot
Subgraph Matching: A New Decomposition Based Approach
inferred← citeshttps://doi.org/10.14778/3750601.3750695openalex-snapshot
Systems for Scalable Graph Analytics and Machine Learning: Trends and Methods
inferred← citeshttps://doi.org/10.14778/3773731.3773736openalex-snapshot
Mayura: Exploiting Similarities in Motifs for Temporal Co-Mining
inferred← citeshttps://doi.org/10.14778/3778092.3778106openalex-snapshot
Aquila: A High-Concurrency System for Incremental Graph Query
inferred← citeshttps://doi.org/10.14778/3801059.3801076openalex-snapshot
Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration
inferred← citeshttps://doi.org/10.3390/bdcc9100258openalex-snapshot
Data Organisation for Efficient Pattern Retrieval: Indexing, Storage, and Access Structures
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.