On the public citation graph

A note on hyperedge replacement

https://doi.org/10.1007/bfb0017373
0 signed · 35 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.
Claim with ORCID
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.
See reference health

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-5_41openalex-snapshot
May we introduce to you: Hyperedge replacement
inferredcites →https://doi.org/10.1007/3-540-18771-5_49openalex-snapshot
A representation of graphs by algebraic expressions and its use for graph rewriting systems
inferredcites →https://doi.org/10.1007/3-540-18771-5_50openalex-snapshot
On context-free sets of graphs and their monadic second-order theory
inferredcites →https://doi.org/10.1007/3-540-19488-6_105openalex-snapshot
Problems easy for tree-decomposable graphs extended abstract
inferredcites →https://doi.org/10.1007/3-540-19488-6_110openalex-snapshot
Dynamic programming on graphs with bounded treewidth
inferredcites →https://doi.org/10.1007/3-540-19488-6_129openalex-snapshot
Efficient analysis of graph properties on context-free graph languages
inferredcites →https://doi.org/10.1007/3-540-50939-9_138openalex-snapshot
Decidable boundedness problems for hyperedge-replacement graph grammars
inferredcites →https://doi.org/10.1007/bf00288976openalex-snapshot
Metatheorems for decision problems on hyperedge replacement graph languages
inferredcites →https://doi.org/10.1007/bf00289017openalex-snapshot
The complexity of graph languages generated by hyperedge replacement
inferredcites →https://doi.org/10.1007/bf01692060openalex-snapshot
Graph expressions and graph rewritings
inferredcites →https://doi.org/10.1007/bf01934985openalex-snapshot
Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey
inferredcites →https://doi.org/10.1007/bf02088013openalex-snapshot
The monadic second-order logic of graphs, II: Infinite graphs of bounded width
inferredcites →https://doi.org/10.1007/bfb0025726openalex-snapshot
A pumping lemma for context-free graph languages
inferredcites →https://doi.org/10.1007/bfb0026094openalex-snapshot
Decomposition trees: Structured graph representation and efficient algorithms
inferredcites →https://doi.org/10.1007/bfb0039608openalex-snapshot
Some structural aspects of hypergraph languages generated by hyperedge replacement
inferredcites →https://doi.org/10.1016/0196-6774(86)90023-4openalex-snapshot
Graph minors. II. Algorithmic aspects of tree-width
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/s0020-0255(71)80008-7openalex-snapshot
Plex languages
inferredcites →https://doi.org/10.1145/321679.321682openalex-snapshot
Linear and Context-Free Graph Grammars

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-56610-4_63openalex-snapshot
Hyperedge replacement with rendezvous
inferred← citeshttps://doi.org/10.1007/3-540-59498-1_250openalex-snapshot
Graphical representation and manipulation of complex structures based on a formal model
inferred← citeshttps://doi.org/10.1007/3-540-60614-9_2openalex-snapshot
Generating editors for direct manipulation of diagrams
inferred← citeshttps://doi.org/10.1007/978-3-540-39890-5_21openalex-snapshot
NCE Graph Grammars and Clique-Width
inferred← citeshttps://doi.org/10.1007/978-3-642-03845-7_11openalex-snapshot
The κ-Lattice: Decidability Boundaries for Qualitative Analysis in Biological Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-78486-6_56openalex-snapshot
Spezifikation von Diagrammeditoren mit automatischer Layoutanpassung
inferred← citeshttps://doi.org/10.1007/bf03037287openalex-snapshot
P systems with local graph productions
inferred← citeshttps://doi.org/10.1007/bfb0017471openalex-snapshot
Graph grammars and tree transducers
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/s0304-3975(97)00228-4openalex-snapshot
A partial k-arboretum of graphs with bounded treewidth
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00226-6openalex-snapshot
Generating irregular partitionable data structures
inferred← citeshttps://doi.org/10.1080/09540090110072327openalex-snapshot
Connectionist learning of regular graph grammars
inferred← citeshttps://doi.org/10.1109/vl.1993.269604openalex-snapshot
A framework for formally defining the syntax of visual languages
inferred← citeshttps://doi.org/10.1109/vl.1993.269618openalex-snapshot
Specification of diagram editors providing layout adjustment with minimal change
inferred← citeshttps://doi.org/10.1109/vl.1995.520810openalex-snapshot
DiaGen: a generator for diagram editors providing direct manipulation and execution of diagrams
inferred← citeshttps://doi.org/10.1109/vl.1997.626587openalex-snapshot
Diagram editing with hypergraph parser support
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.