On the public citation graph
GuP: Fast Subgraph Matching by Guard-based Pruning
0 signed · 78 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/3-540-45349-0_19openalex-snapshot
Maintaining Arc-Consistency within Dynamic Backtracking
inferredcites →https://doi.org/10.1007/978-1-349-13908-8_1openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1007/978-3-030-51372-6_19openalex-snapshot
The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants
inferredcites →https://doi.org/10.1007/978-3-319-23219-5_21openalex-snapshot
A Parallel, Backjumping Subgraph Isomorphism Algorithm Using Supplemental Graphs
inferredcites →https://doi.org/10.1007/s00778-022-00749-xopenalex-snapshot
Fast subgraph query processing and subgraph matching via static and dynamic equivalences
inferredcites →https://doi.org/10.1016/0004-3702(77)90029-7openalex-snapshot
Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
inferredcites →https://doi.org/10.1090/cbms/107/01openalex-snapshot
Graph theory in the information age
inferredcites →https://doi.org/10.1109/tkde.2020.2980257openalex-snapshot
Subgraph Matching With Effective Matching Order and Indexing
inferredcites →https://doi.org/10.1109/tpami.2004.75openalex-snapshot
A (sub)graph isomorphism algorithm for matching large graphs
inferredcites →https://doi.org/10.1145/130283openalex-snapshot
Proceedings of the 1992 ACM SIGMOD international conference on Management of data
inferredcites →https://doi.org/10.1145/1951365openalex-snapshot
Proceedings of the 14th International Conference on Extending Database Technology
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/3299869openalex-snapshot
Proceedings of the 2019 International Conference on Management of Data
inferredcites →https://doi.org/10.1145/3318464.3380581openalex-snapshot
In-Memory Subgraph Matching: An In-depth Study
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.1371/journal.pone.0076911openalex-snapshot
GRAPES: A Software for Parallel Searching on Biological Graphs Targeting Multi-Core Architectures
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/2535568.2448946openalex-snapshot
An in-depth comparison of subgraph isomorphism algorithms in graph databases
inferredcites →https://doi.org/10.14778/2794367.2794368openalex-snapshot
Scalable subgraph enumeration in MapReduce
inferredcites →https://doi.org/10.14778/2809974.2809985openalex-snapshot
Taming subgraph isomorphism for RDF query processing
inferredcites →https://doi.org/10.14778/3021924.3021937openalex-snapshot
Scalable distributed subgraph enumeration
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/3402707.3402747openalex-snapshot
Scalable SPARQL querying of large RDF graphs
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-95-0017-8_29openalex-snapshot
GAP: Adaptive DFS Branch-Level Parallel Subgraph Matching
inferred← citeshttps://doi.org/10.1007/978-981-95-6426-2_25openalex-snapshot
Accelerating Subgraph Matching Using Isolated Vertices and BFS Data Structures
inferred← citeshttps://doi.org/10.1007/978-981-95-7996-9_5openalex-snapshot
Efficient Subgraph Matching with Adaptive Filtering and Core-Set Prioritization
inferred← citeshttps://doi.org/10.1007/978-981-96-0567-5_26openalex-snapshot
Two Birds One Stone: Dual-Role Path Based Subgraph Matching Using Partial Evaluation
inferred← citeshttps://doi.org/10.1007/s10115-025-02608-xopenalex-snapshot
TriFMatch: a flash subgraph matching algorithm with effective filtering techniques
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00231openalex-snapshot
Large Subgraph Matching: A Comprehensive and Efficient Approach for Heterogeneous Graphs
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00250openalex-snapshot
Efficient Multi-Query Oriented Continuous Subgraph Matching
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00082openalex-snapshot
TeMatch: A Fast Temporal Subgraph Matching Framework with Temporal-Aware Subgraph Matching Algorithms
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00188openalex-snapshot
On Temporal-Constraint Subgraph Matching
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00192openalex-snapshot
MuSha: Subgraph Matching by Multilevel Sharing
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00267openalex-snapshot
LSM-Community: A Graph Storage System Exploiting Community Structure in Social Networks
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00304openalex-snapshot
OptMatch: An Efficient and Generic Neural Network-Assisted Subgraph Matching Approach
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00366openalex-snapshot
RAISIN: A Parallel Subgraph Matching Tool Exploiting Community Structures in Social Networks
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00248openalex-snapshot
Efficient Graph Matching with Pattern Reduction
inferred← citeshttps://doi.org/10.1109/ickg63256.2024.00052openalex-snapshot
OrbitSI: An Orbit-based Algorithm for the Subgraph Isomorphism Search Problem
inferred← citeshttps://doi.org/10.1109/icws72778.2026.00178openalex-snapshot
Efficient Partition-Based Subgraph Matching for Web Service
inferred← citeshttps://doi.org/10.1109/tkde.2026.3702627openalex-snapshot
Accelerating Top-K Subgraph Matching With Topology-Aware Pruning and Parallel Processing
inferred← citeshttps://doi.org/10.1109/tkde.2026.3721816openalex-snapshot
Efficient Multi-Query Optimization for Continuous Subgraph Matching Over Streaming Graphs
inferred← citeshttps://doi.org/10.1145/3627673.3679790openalex-snapshot
Efficient Pruned Top-K Subgraph Matching with Topology-Aware Bounds
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/3701551.3703516openalex-snapshot
RSM: Reinforced Subgraph Matching Framework with Fine-grained Operation based Search Plan
inferred← citeshttps://doi.org/10.1145/3709665openalex-snapshot
BⓈ X : Subgraph Matching with Batch Backtracking Search
inferred← citeshttps://doi.org/10.1145/3711896.3737006openalex-snapshot
Improving Subgraph Matching by Combining Algorithms and Graph Neural Networks
inferred← citeshttps://doi.org/10.1145/3725323openalex-snapshot
MatCo: Computing Match Cover of Subgraph Query over Graph Data
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/3749159openalex-snapshot
BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching
inferred← citeshttps://doi.org/10.1145/3769806openalex-snapshot
MAVIS: Materialized View for Subgraph Matching
inferred← citeshttps://doi.org/10.1145/3771791openalex-snapshot
A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis]
inferred← citeshttps://doi.org/10.1145/3786648openalex-snapshot
Enumerating Graph Pattern Matches with ML Oracles
inferred← citeshttps://doi.org/10.1145/3802022openalex-snapshot
Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching
inferred← citeshttps://doi.org/10.1145/3802047openalex-snapshot
Efficient Meta-subgraph Instance Search over Large Heterogeneous Information Networks
inferred← citeshttps://doi.org/10.1145/3805712.3809567openalex-snapshot
GNN-based Anchor Embedding for Efficient Subgraph Retrieval
inferred← citeshttps://doi.org/10.14778/3659437.3659451openalex-snapshot
Fast Local Subgraph Counting
inferred← citeshttps://doi.org/10.14778/3681954.3681963openalex-snapshot
TC-Match: Fast Time-Constrained Continuous Subgraph Matching
inferred← citeshttps://doi.org/10.14778/3742728.3742758openalex-snapshot
Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach
inferred← citeshttps://doi.org/10.14778/3749646.3749662openalex-snapshot
Accelerating Subgraph Matching through Fine-Grained and Powerful Equivalences
inferred← citeshttps://doi.org/10.14778/3749646.3749693openalex-snapshot
Subgraph Matching: A New Decomposition Based Approach
inferred← citeshttps://doi.org/10.14778/3773731.3773737openalex-snapshot
Mix & Match: Subgraph Matching for Absolute Coverage
inferred← citeshttps://doi.org/10.14778/3785297.3785310openalex-snapshot
Efficient Partition-Based Approaches for Diversified Top- k Subgraph Matching
inferred← citeshttps://doi.org/10.14778/3801059.3801070openalex-snapshot
CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination
inferred← citeshttps://doi.org/10.14778/3819518.3819552openalex-snapshot
Subgraph Enumeration: Beyond Tree Decomposition
inferred← citeshttps://doi.org/10.3390/sym18101604openalex-snapshot
Improved Exact Algorithm for Finding a Maximum Exploratory Equivalent Partition
inferred← citeshttps://doi.org/10.53829/ntr202411fa4openalex-snapshot
Fast Knowledge Discovery from Big Data--Large-scale Data Analysis with Accuracy Guarantee via Efficient Pruning Methods
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.