On the public citation graph
A Survey on Distributed Graph Pattern Matching in Massive Graphs
0 signed · 136 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/978-3-319-18120-2_18openalex-snapshot
Fast Subgraph Matching on Large Graphs using Graphics Processors
inferredcites →https://doi.org/10.1007/978-3-319-18224-7_17openalex-snapshot
VF2 Plus: An Improved version of VF2 for Biological Graphs
inferredcites →https://doi.org/10.1007/978-3-319-41576-5openalex-snapshot
Biomedical Data Management and Graph Online Querying
inferredcites →https://doi.org/10.1007/978-3-642-37210-0_37openalex-snapshot
Discovering Patterns in Social Networks with Graph Matching Algorithms
inferredcites →https://doi.org/10.1007/s00778-015-0415-0openalex-snapshot
Processing SPARQL queries over distributed RDF graphs
inferredcites →https://doi.org/10.1007/s11280-019-00674-0openalex-snapshot
Distributed time-respecting flow graph pattern matching on temporal graphs
inferredcites →https://doi.org/10.1016/j.dam.2018.02.018openalex-snapshot
VF2++—An improved subgraph isomorphism algorithm
inferredcites →https://doi.org/10.1016/j.ins.2018.01.018openalex-snapshot
Parallel algorithms for flexible pattern matching on big graphs
inferredcites →https://doi.org/10.1016/j.ins.2019.01.036openalex-snapshot
Correct filtering for subgraph isomorphism search in compressed vertex-labeled graphs
inferredcites →https://doi.org/10.1016/j.jpdc.2012.10.005openalex-snapshot
Inexact subgraph isomorphism in MapReduce
inferredcites →https://doi.org/10.1016/j.knosys.2016.07.009openalex-snapshot
Efficient pattern matching for graphs with multi-Labeled nodes
inferredcites →https://doi.org/10.1016/j.knosys.2017.11.008openalex-snapshot
Personalized graph pattern matching via limited simulation
inferredcites →https://doi.org/10.1016/j.patcog.2014.01.002openalex-snapshot
A long trip in the charming world of graphs for Pattern Recognition
inferredcites →https://doi.org/10.1016/j.patrec.2018.06.025openalex-snapshot
Comparing performance of graph matching algorithms on huge graphs
inferredcites →https://doi.org/10.1016/j.patrec.2019.07.001openalex-snapshot
VF3-Light: A lightweight subgraph isomorphism algorithm and its experimental evaluation
inferredcites →https://doi.org/10.1093/comjnl/bxu159openalex-snapshot
PRS: Parallel Relaxation Simulation for Massive Graphs
inferredcites →https://doi.org/10.1109/bigdata.2013.6691601openalex-snapshot
A distributed vertex-centric approach for pattern matching in massive graphs
inferredcites →https://doi.org/10.1109/cluster.2017.85openalex-snapshot
Towards Practical and Robust Labeled Pattern Matching in Trillion-Edge Graphs
inferredcites →https://doi.org/10.1109/icde.2014.6816681openalex-snapshot
Continuous pattern detection over billion-edge graph using distributed framework
inferredcites →https://doi.org/10.1109/icde.2019.00021openalex-snapshot
BENU: Distributed Subgraph Enumeration with Backtracking-Based Framework
inferredcites →https://doi.org/10.1109/icws.2017.69openalex-snapshot
Multi-Constrained Top-K Graph Pattern Matching in Contextual Social Graphs
inferredcites →https://doi.org/10.1109/padsw.2018.8644869openalex-snapshot
Parallelizing Recursive Backtracking Based Subgraph Matching on a Single Machine
inferredcites →https://doi.org/10.1109/sc.2018.00024openalex-snapshot
PruneJuice: Pruning Trillion-edge Graphs to a Precise Pattern-Matching Solution
inferredcites →https://doi.org/10.1109/sfcs.1995.492576openalex-snapshot
Computing simulations on finite and infinite graphs
inferredcites →https://doi.org/10.1109/tkde.2017.2762294openalex-snapshot
High-Level Programming Abstractions for Distributed Graph Processing
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.2017.2696940openalex-snapshot
Challenging the Time Complexity of Exact Subgraph Isomorphism for Huge and Dense Graphs with VF3
inferredcites →https://doi.org/10.1142/s0218001404003228openalex-snapshot
THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION
inferredcites →https://doi.org/10.1142/s0218001414500013openalex-snapshot
GRAPH MATCHING AND LEARNING IN PATTERN RECOGNITION IN THE LAST 10 YEARS
inferredcites →https://doi.org/10.1145/2187836.2187963openalex-snapshot
Distributed graph pattern matching
inferredcites →https://doi.org/10.1145/2588555.2588557openalex-snapshot
Parallel subgraph listing in a large-scale graph
inferredcites →https://doi.org/10.1145/2736277.2741096openalex-snapshot
Effective Techniques for Message Reduction and Load Balancing in Distributed Graph Computation
inferredcites →https://doi.org/10.1145/2882903.2915236openalex-snapshot
Efficient Subgraph Matching by Postponing Cartesian Products
inferredcites →https://doi.org/10.1145/2915516.2915519openalex-snapshot
Distributed Incremental Pattern Matching on Streaming Graphs
inferredcites →https://doi.org/10.1145/3132847.3132992openalex-snapshot
Relaxing Graph Pattern Matching With Explanations
inferredcites →https://doi.org/10.1145/321921.321925openalex-snapshot
An Algorithm for Subgraph Isomorphism
inferredcites →https://doi.org/10.1145/3282488openalex-snapshot
Parallelizing Sequential Graph Computations
inferredcites →https://doi.org/10.1145/3318464.3380566openalex-snapshot
Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees
inferredcites →https://doi.org/10.1145/3318464.3380581openalex-snapshot
In-Memory Subgraph Matching: An In-depth Study
inferredcites →https://doi.org/10.1145/3749740.3749753openalex-snapshot
A Bridging Model for Parallel Computation
inferredcites →https://doi.org/10.1145/509404openalex-snapshot
Proceedings of the 1977 ACM SIGMOD international conference on Management of data - SIGMOD '77
inferredcites →https://doi.org/10.1155/2018/6749561openalex-snapshot
Incremental Graph Pattern Matching Algorithm for Big Graph Data
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/2095686.2095690openalex-snapshot
Capturing topology in graph pattern matching
inferredcites →https://doi.org/10.14778/2311906.2311907openalex-snapshot
Efficient subgraph matching on billion node graphs
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/2535570.2488333openalex-snapshot
A distributed graph engine for web scale RDF data
inferredcites →https://doi.org/10.14778/2732232.2732238openalex-snapshot
From "think like a vertex" to "think like a graph"
inferredcites →https://doi.org/10.14778/2732977.2732983openalex-snapshot
Distributed graph simulation
inferredcites →https://doi.org/10.14778/2735479.2735493openalex-snapshot
Exploiting vertex relationships in speeding up subgraph isomorphism over large graphs
inferredcites →https://doi.org/10.14778/2904483.2904488openalex-snapshot
A general-purpose query-centric framework for querying big graphs
inferredcites →https://doi.org/10.14778/3021924.3021929openalex-snapshot
Multi-query optimization for subgraph isomorphism search
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/3339490.3339494openalex-snapshot
Distributed subgraph matching on timely dataflow
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.29268/stbd.2014.1.1.1openalex-snapshot
Distributed and Scalable Graph Pattern Matching: Models and Algorithms
inferredcites →https://doi.org/10.48550/arxiv.1601.05590openalex-snapshot
Efficient Processing of Very Large Graphs in a Small Cluster
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-3-031-14135-5_19openalex-snapshot
Graph Analytics Workflows Enactment on Just in Time Data Centres Position Paper
inferred← citeshttps://doi.org/10.1007/978-3-031-21743-2_6openalex-snapshot
Frequent Closed Subgraph Mining: A Multi-thread Approach
inferred← citeshttps://doi.org/10.1007/978-3-031-82435-7_33openalex-snapshot
Exploiting Vertex-Cut Partitioning in Distributed Graph Generation
inferred← citeshttps://doi.org/10.1007/978-3-031-99565-1_21openalex-snapshot
A New Subgraph Extraction Algorithm Through a Kinship Approach for Link Prediction in Knowledge Graphs
inferred← citeshttps://doi.org/10.1007/978-3-032-05727-3_30openalex-snapshot
DGP: Towards A Distributed Graph Programming
inferred← citeshttps://doi.org/10.1007/s10588-026-09447-3openalex-snapshot
Distributed Graph Generation Using JDM Replication
inferred← citeshttps://doi.org/10.1007/s10766-025-00792-5openalex-snapshot
SGgraph: A Scalable GPU-Based Edge-Centric Graph Processing Framework
inferred← citeshttps://doi.org/10.1007/s11227-021-03938-7openalex-snapshot
Efficient parallel edge-centric approach for relaxed graph pattern matching
inferred← citeshttps://doi.org/10.1007/s11227-024-06283-7openalex-snapshot
GPU-accelerated relaxed graph pattern matching algorithms
inferred← citeshttps://doi.org/10.1016/b978-0-443-30040-0.00015-1openalex-snapshot
Emerging graphical data management methodologies for automated driving
inferred← citeshttps://doi.org/10.1016/j.bdr.2024.100464openalex-snapshot
Scalable Diversified Top-k Pattern Matching in Big Graphs
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106529openalex-snapshot
Algorithms and computational study on a transportation system integrating public transit and ridesharing of personal vehicles
inferred← citeshttps://doi.org/10.1016/j.cosrev.2026.100981openalex-snapshot
Data analytics algorithms in property graph databases: A survey
inferred← citeshttps://doi.org/10.1016/j.eng.2023.07.014openalex-snapshot
A Survey of Tax Risk Detection Using Data Mining Techniques
inferred← citeshttps://doi.org/10.1016/j.ins.2021.07.071openalex-snapshot
Subgraph matching on temporal graphs
inferred← citeshttps://doi.org/10.1016/j.ins.2022.08.038openalex-snapshot
Distributed graph pattern matching via bounded dual simulation
inferred← citeshttps://doi.org/10.1016/j.ins.2024.121571openalex-snapshot
Size-fixed group discovery via multi-constrained graph pattern matching
inferred← citeshttps://doi.org/10.1016/j.knosys.2022.109961openalex-snapshot
Evolving subgraph matching on temporal graphs
inferred← citeshttps://doi.org/10.1093/comjnl/bxac161openalex-snapshot
Distributed Partial Simulation for Graph Pattern Matching
inferred← citeshttps://doi.org/10.1109/access.2025.3596871openalex-snapshot
The Current Landscape of Scalable Dynamic Graph Processing
inferred← citeshttps://doi.org/10.1109/icc51166.2024.10622213openalex-snapshot
Real-Time and Low-Overhead Graph Task Scheduling over Vehicular Computing-Assisted Edge Networks
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00082openalex-snapshot
Hybrid Subgraph Matching Framework Powered by Sketch Tree for Distributed Systems
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00278openalex-snapshot
Subgraph Query Generation with Fairness and Diversity Constraints
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00311openalex-snapshot
Reachability Queries with Label and Substructure Constraints on Knowledge Graphs (Extended abstract)
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00188openalex-snapshot
On Temporal-Constraint Subgraph Matching
inferred← citeshttps://doi.org/10.1109/swc57546.2023.10448994openalex-snapshot
Recommending Orchestration Plan for Space-Ground Integration Information Network: A Subgraph Matching Approach
inferred← citeshttps://doi.org/10.1109/tcad.2025.3529802openalex-snapshot
TeMACLE: A Technology Mapping-Aware Area-Efficient Standard Cell Library Extension Framework
inferred← citeshttps://doi.org/10.1109/tcss.2023.3303476openalex-snapshot
A Generalized Community-Structure-Aware Optimization Framework for Efficient Subgraph Matching in Social Network Analysis
inferred← citeshttps://doi.org/10.1109/tkde.2022.3161375openalex-snapshot
Reachability Queries with Label and Substructure Constraints on Knowledge Graphs
inferred← citeshttps://doi.org/10.1145/3488560.3498525openalex-snapshot
Diversified Subgraph Query Generation with Group Fairness
inferred← citeshttps://doi.org/10.1145/3582302.3582320openalex-snapshot
The World of Graph Databases from An Industry Perspective
inferred← citeshttps://doi.org/10.1145/3589329openalex-snapshot
GraphINC: Graph Pattern Mining at Network Speed
inferred← citeshttps://doi.org/10.1145/3694966openalex-snapshot
A Survey of Distributed Graph Algorithms on Massive Graphs
inferred← citeshttps://doi.org/10.1145/3719027.3765131openalex-snapshot
Looping for Good: Cyclic Proofs for Security Protocols
inferred← citeshttps://doi.org/10.1145/3721473openalex-snapshot
Proceedings of the 12th Workshop on Principles and Practice of Consistency for Distributed Data
inferred← citeshttps://doi.org/10.1145/3721473.3722139openalex-snapshot
Towards Local-First Distributed Property Graphs
inferred← citeshttps://doi.org/10.1145/3778862openalex-snapshot
Directed Acyclic Graph Topology Generators: A Survey
inferred← citeshttps://doi.org/10.1177/10943420231166610openalex-snapshot
A Survey of Graph Comparison Methods with Applications to Nondeterminism in High-Performance Computing
inferred← citeshttps://doi.org/10.1186/s40537-022-00572-9openalex-snapshot
Detection of fickle trolls in large-scale online social networks
inferred← citeshttps://doi.org/10.14778/3685800.3685810openalex-snapshot
KGFabric: A Scalable Knowledge Graph Warehouse for Enterprise Data Interconnection
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.32388/v8qvhaopenalex-snapshot
Top Ten Challenges Towards Agentic Neural Graph Databases
inferred← citeshttps://doi.org/10.3390/a18070445openalex-snapshot
Domain-Specific Languages for Algorithmic Graph Processing: A Systematic Literature Review
inferred← citeshttps://doi.org/10.3390/bdcc9100258openalex-snapshot
Data Organisation for Efficient Pattern Retrieval: Indexing, Storage, and Access Structures
inferred← citeshttps://doi.org/10.3390/electronics11040660openalex-snapshot
Cost Model Based Incremental Processing in Dynamic Graphs
inferred← citeshttps://doi.org/10.3390/electronics12173645openalex-snapshot
Distributed Subgraph Query Processing Using Filtering Scores on Spark
inferred← citeshttps://doi.org/10.3390/electronics13214191openalex-snapshot
Categorical Multi-Query Subgraph Matching on Labeled Graph
inferred← citeshttps://doi.org/10.3390/sym17101659openalex-snapshot
A Logical Characterization for Approximate Matching of Pattern Graphs with Regular Expressions
inferred← citeshttps://doi.org/10.48550/arxiv.2103.10838openalex-snapshot
A systematic association of subgraph counts over a network
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.