On the public citation graph
Recognizing edge replacement graph languages in cubic time
0 signed · 37 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-19488-6_128openalex-snapshot
Efficient algorithms on context-free graph languages
inferredcites →https://doi.org/10.1007/3-540-52292-1_6openalex-snapshot
On hyperedge replacement and BNLC graph grammars
inferredcites →https://doi.org/10.1007/978-3-642-95486-3_18openalex-snapshot
Rule Trees Represent Derivations in Edge Replacement Systems
inferredcites →https://doi.org/10.1007/bf01692060openalex-snapshot
Graph expressions and graph rewritings
inferredcites →https://doi.org/10.1007/bf01694011openalex-snapshot
Counter machines and counter languages
inferredcites →https://doi.org/10.1007/bfb0000094openalex-snapshot
Graph-Grammars and Their Application to Computer Science
inferredcites →https://doi.org/10.1007/bfb0013875openalex-snapshot
Hyperedge Replacement: Grammars and Languages
inferredcites →https://doi.org/10.1007/bfb0025713openalex-snapshot
Graph-Grammars and Their Application to Computer Science and Biology
inferredcites →https://doi.org/10.1007/bfb0039608openalex-snapshot
Some structural aspects of hypergraph languages generated by hyperedge replacement
inferredcites →https://doi.org/10.1016/0020-0271(67)90007-1openalex-snapshot
The mathematical theory of context-free languages
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0166-218x(87)90051-5openalex-snapshot
String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
inferredcites →https://doi.org/10.1016/0304-3975(87)90050-8openalex-snapshot
Characteristics of graph languages generated by edge replacement
inferredcites →https://doi.org/10.1016/0304-3975(87)90102-2openalex-snapshot
An axiomatic definition of context-free rewriting and its application to NLC graph grammars
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/0890-5401(90)90038-jopenalex-snapshot
A comparison of boundary graph grammars and context-free hypergraph grammars
inferredcites →https://doi.org/10.1016/s0019-9958(86)80045-6openalex-snapshot
Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
inferredcites →https://doi.org/10.1137/0202012openalex-snapshot
Dividing a Graph into Triconnected Components
inferredcites →https://doi.org/10.1145/28395.28396openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1215/s0012-7094-37-00336-3openalex-snapshot
A structural characterization of planar combinatorial 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/11841883_26openalex-snapshot
Graph Transformation in Constant Time
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_88openalex-snapshot
The use of tree transducers to compute translations between graph algebras
inferred← citeshttps://doi.org/10.1007/978-3-030-23611-3_4openalex-snapshot
Extending Predictive Shift-Reduce Parsing to Contextual Hyperedge Replacement Grammars
inferred← citeshttps://doi.org/10.1007/978-3-032-29730-3_1openalex-snapshot
LR-Based Parsing of Hypergraph Languages: A Positional Grammar Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-21145-9_2openalex-snapshot
Predictive Top-Down Parsing for Hyperedge Replacement Grammars
inferred← citeshttps://doi.org/10.1007/978-3-319-61470-0_7openalex-snapshot
Predictive Shift-Reduce Parsing for Hyperedge Replacement Grammars
inferred← citeshttps://doi.org/10.1007/bfb0017411openalex-snapshot
Recognizing rooted context-free flowgraph languages in polynomial time
inferred← citeshttps://doi.org/10.1007/s002240000115openalex-snapshot
A Characterization of the Sets of Hypertrees Generated by Hyperedge-Replacement Graph Grammars
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90221-topenalex-snapshot
NP-completeness of k-connected hyperedge-replacement languages of order k
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90019-1openalex-snapshot
The monadic second order logic of graphs VI: on several representations of graphs by relational structures
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90065-2openalex-snapshot
Recognising k-connected hypergraphs in cubic time
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.10.002openalex-snapshot
Uniform parsing for hyperedge replacement grammars
inferred← citeshttps://doi.org/10.1051/ita/1992260302571openalex-snapshot
The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
inferred← citeshttps://doi.org/10.1142/9789812384720_0002openalex-snapshot
HYPEREDGE REPLACEMENT GRAPH GRAMMARS
inferred← citeshttps://doi.org/10.4204/eptcs.417.8openalex-snapshot
Finite Automata for Efficient Graph Recognition
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.