Displaying similar documents to “Hypergraph systems and their extensions”

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...

Centers in line graphs

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

Mathematica Slovaca

Similarity:

Cutwidth of the de Bruijn graph

André Raspaud, Ondrej Sýkora, Imrich Vrt'o (1995)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity: