Graph rewriting

Known as: Graph grammar, Graph transformation 
In computer science, graph transformation, or graph rewriting, concerns the technique of creating a new graph out of an original graph… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1967-2018
010020019672018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2004
Highly Cited
2004
Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2001
2001
ion operator, 38 acyclic, 48 algebraic specification, 3 alpha conversion of cyclic terms, 44 annotated path, 47 ARS with finite… (More)
  • table 1.1
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
Is this relevant?
1999
1999
This paper introduces GRS-based AOP which explains a large subclass of AOP weavers as graph rewrite systems (GRS). The… (More)
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
6 798;:=<?>A@B:DC Graph grammars and graph rewrite systems improved a lot towards practical usability during the last years… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We present an equational framework for term graph rewriting with cycles. The usual notion of homomorphism is phrased in terms of… (More)
  • figure 3
  • figure 12
Is this relevant?
1994
1994
This paper is concerned with the study of cyclic-graphs. The starting point is to treat a-graph as a system of recursion… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
To summarize, triple graph grammars are a new formalism for the specification of complex interdependencies between separate and… (More)
  • figure 7
  • figure 6
  • figure 5
  • figure 4
  • figure 3
Is this relevant?
Highly Cited
1993
Highly Cited
1993
functional programming and parallel graph rewriting What to say and what to do when mostly your friends love reading? Are you the… (More)
Is this relevant?
1992
1992
Graph rewrite systems play an important role in the implementation of functional programming languages. This paper focusses on… (More)
Is this relevant?
Highly Cited
1987
Highly Cited
1987
We define an algebraic structure for the set of finite graphs, a notion of graph expression for defining them, and a complete set… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?