Found 2 document(s)
Page 1 of 1
-
We define two graph transformations, one by parallelizing graph rewrite rules, the other by taking quotients of graphs. The former consists in the exhaustive application of local transformations defined by graph rewrite ...
-
Does a graph necessarily have nodes? May an edge be adjacent to itself and be a self-loop? These questions arise in the study of graph structures, i.e., monadic many-sorted signatures and the corresponding algebras. A si...