Live briefing
Everything about Graph rewriting
Creating a new graph from an existing graph
In computer science, graph transformation, or graph rewriting, concerns the technique of creating a new graph out of an original graph algorithmically. It has numerous applications, ranging from software engineering to layout algorithms and picture generation. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Graph rewritingA 5-minute orientation
- Skim a recent paper: ROVER: RTL Optimization via Verified E-Graph RewritingInfluential work since 2022
- Pick up a classic book: Applications of graph transformations with industrial relevanceThe most-reprinted book on the subject
- Read the landmark paper: EQUATIONAL TERM GRAPH REWRITINGCited 58 times
- Go sideways: Double pushout graph rewritingA closely related topic
- Go sideways: Attributed graph grammarA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
EQUATIONAL TERM GRAPH REWRITING
On the adequacy of graph rewriting for simulating term rewriting
Termination of Graph Rewriting is Undecidable
Graph rewriting for the π-calculus
Strategic port graph rewriting: an interactive modelling framework
Computing with graph rewriting systems with priorities
A Graph-Rewriting Paradigm for Discrete Relaxation
Essentials of Term Graph Rewriting
🆕 Influential since 2022
ROVER: RTL Optimization via Verified E-Graph Rewriting
Graph Rewriting Techniques in Engineering Design
Reducing the number of migrated instances during business process change: A graph rewriting approach
Using graph rewriting to operationalize medical knowledge for the revision of concurrently applied clinical practice guidelines
Constraint-Aware E-Graph Rewriting for Hardware Performance Optimization
📚 Books worth reading
Applications of graph transformations with industrial relevanceManfred Nagl · 2000
Term graph rewritingM. R. Sleep, M. J. Plasmeijer · 1993- 📕Graphersetzungssysteme · 1977
- 📕Operationales Spezifizieren mit programmierten GraphersetzungssystemenAndreas Schürr · 1991
- 📕Three papers on graph rewriting systems and their applicationsHartmut Ehrig · 1975
Functional programming and parallel graph rewritingM. J. Plasmeijer · 1993
Graph ReductionJoseph H. Fasel, Robert M. Keller · 1987
Concurrency Graphs And Models Essays Dedicated To Ugo Montanari On The Occasion Of His 65th BirthdayPierpaolo Degano · 2008
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Double pushout graph rewriting In computer science, double pushout graph rewriting (or DPO graph rewriting) refers to a mathematical framework for graph rewriting. It was introduced…
- Attributed graph grammar In computer science, an attributed graph grammar is a class of graph grammar that associates vertices with a set of attributes and rewrites with functions…
- Term graph A term graph is a representation of an expression in a formal language as a generalized graph whose vertices are terms[clarification needed]. Term graphs…
- Single pushout graph rewriting In computer science, a single pushout graph rewriting or SPO graph rewriting refers to a mathematical framework for graph rewriting, and is used in contrast…
- Subgraph isomorphism problem In theoretical computer science, the subgraph isomorphism problem is a computational task in which two graphs G {\displaystyle G} and H {\displaystyle…
- Regulated rewriting Regulated rewriting is a specific area of formal languages studying grammatical systems which are able to take some kind of control over the production…
- Hartmut Ehrig Hartmut Ehrig (born 6 December 1944 in Angermünde; died 17 March 2016) was a German computer scientist and professor of theoretical computer science and…
- L-system An L-system or Lindenmayer system is a parallel rewriting system and a type of formal grammar. An L-system consists of an alphabet of symbols that can…