On the public citation graph
An efficient implementation of graph grammars based on the RETE matching algorithm
0 signed · 38 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-18771-5openalex-snapshot
Graph-Grammars and Their Application to Computer Science
inferredcites →https://doi.org/10.1007/3-540-18771-5_43openalex-snapshot
Set theoretic approaches to graph grammars
inferredcites →https://doi.org/10.1007/3-540-19488-6_104openalex-snapshot
Average case complexity analysis of the RETE multi-pattern match algorithm
inferredcites →https://doi.org/10.1007/bf02249935openalex-snapshot
On the generative power of sequential and parallel programmed graph grammars
inferredcites →https://doi.org/10.1007/bfb0000094openalex-snapshot
Graph-Grammars and Their Application to Computer Science
inferredcites →https://doi.org/10.1007/bfb0000096openalex-snapshot
Graph grammars as a generative tool in image understanding
inferredcites →https://doi.org/10.1007/bfb0025713openalex-snapshot
Graph-Grammars and Their Application to Computer Science and Biology
inferredcites →https://doi.org/10.1016/0004-3702(82)90020-0openalex-snapshot
Rete: A fast algorithm for the many pattern/many object pattern match problem
inferredcites →https://doi.org/10.1016/0096-0551(86)90018-4openalex-snapshot
Programming expert systems in OPS5
inferredcites →https://doi.org/10.1016/0167-8655(83)90033-8openalex-snapshot
Inexact graph matching for structural pattern recognition
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-024x(199903)29:3<197::aid-spe228>3.0.co;2-fopenalex-snapshot
Computing with graphs and graph transformations
inferred← citeshttps://doi.org/10.1007/3-540-59071-4_57openalex-snapshot
Bypass strong V-structures and find an isomorphic labelled subgraph in linear time
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_105openalex-snapshot
Graph pattern matching in PROGRES
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_78openalex-snapshot
Issues in the practical use of graph rewriting
inferred← citeshttps://doi.org/10.1007/978-3-319-40530-8_11openalex-snapshot
On the Operationalization of Graph Queries with Generalized Discrimination Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-68015-6_6openalex-snapshot
Model-Driven Engineering of an OpenCypher Engine: Using Graph Queries to Compile Graph Queries
inferred← citeshttps://doi.org/10.1007/978-3-540-31988-7_3openalex-snapshot
Graph Transformation in Document Image Analysis: Approaches and Challenges
inferred← citeshttps://doi.org/10.1007/978-3-540-69927-9_8openalex-snapshot
Live Model Transformations Driven by Incremental Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-87405-8_27openalex-snapshot
A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation
inferred← citeshttps://doi.org/10.1007/978-3-540-89020-1_21openalex-snapshot
Efficient Graph Matching with Application to Cognitive Automation
inferred← citeshttps://doi.org/10.1007/978-3-642-20401-2_27openalex-snapshot
Advances in Model Transformations by Graph Transformation: Specification, Execution and Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-38883-5_13openalex-snapshot
A Rete Network Construction Algorithm for Incremental Pattern Matching
inferred← citeshttps://doi.org/10.1016/s0167-6423(98)00023-9openalex-snapshot
Graph transformation for specification and programming
inferred← citeshttps://doi.org/10.1017/s0960129501003577openalex-snapshot
Constraint satisfaction algorithms for graph pattern matching
inferred← citeshttps://doi.org/10.1109/eurcon.2009.5167663openalex-snapshot
Towards truly parallel model transformations: A distributed pattern matching approach
inferred← citeshttps://doi.org/10.1145/1402947.1402953openalex-snapshot
Incremental pattern matching in the viatra model transformation system
inferred← citeshttps://doi.org/10.1145/1878921.1878926openalex-snapshot
Instruction selection by graph transformation
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.18.265.249openalex-snapshot
Parallelization of Graph Transformation Based on Incremental Pattern Matching
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.32.520openalex-snapshot
Incremental Pattern Matching in Graph-Based State Space Exploration
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.4.12openalex-snapshot
Incremental Graph Pattern Matching: Data Structures and Initial Experiments
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.47.715.746openalex-snapshot
Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.47.736.744openalex-snapshot
Incremental Pattern Matching for Regular Expressions
inferred← citeshttps://doi.org/10.3311/ppee.9769openalex-snapshot
Evaluation of Optimization Strategies for Incremental Graph Queries
inferred← citeshttps://doi.org/10.4204/eptcs.231.5openalex-snapshot
Incremental View Maintenance for Deductive Graph Databases Using Generalized Discrimination Networks
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.