Displaying similar documents to “An economical transformation of graph grammars”

Inferring graph grammars by detecting overlap in frequent subgraphs

Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook (2008)

International Journal of Applied Mathematics and Computer Science

Similarity:

In this paper we study the inference of node and edge replacement graph grammars. We search for frequent subgraphs and then check for an overlap among the instances of the subgraphs in the input graph. If the subgraphs overlap by one node, we propose a node replacement graph grammar production. If the subgraphs overlap by two nodes or two nodes and an edge, we propose an edge replacement graph grammar production. We can also infer a hierarchy of productions by compressing portions of...

Using a graph grammar system in the finite element method

Barbara Strug, Anna Paszyńska, Maciej Paszyński, Ewa Grabska (2013)

International Journal of Applied Mathematics and Computer Science

Similarity:

The paper presents a system of Composite Graph Grammars (CGGs) modelling adaptive two dimensional hp Finite Element Method (hp-FEM) algorithms with rectangular finite elements. A computational mesh is represented by a composite graph. The operations performed over the mesh are defined by the graph grammar rules. The CGG system contains different graph grammars defining different kinds of rules of mesh transformations. These grammars allow one to generate the initial mesh, assign values...

Centers in line graphs

Martin Knor, Ľudovít Niepel, Ľubomír Šoltés (1993)

Mathematica Slovaca

Similarity: