𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algebraic hierarchical graph transformation

✍ Scribed by Wojciech Palacz

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
298 KB
Volume
68
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

✦ Synopsis

This paper presents a framework for constructing hierarchical (hyper)graphs, using one of the wellknown categories of traditional flat (hyper)graphs as a base. Hierarchical graphs are obtained from flat graphs by adding a parent assigning function to them. Any graph atom (vertex or edge) can be assigned as a child of any other atom. Hierarchical graphs are more expressive than flat graphs, yet similar enough that the double-pushout approach to graph transformation can be extended to them.

πŸ“œ SIMILAR VOLUMES

Hierarchical Graph Transformation
Hierarchical Graph Transformation
✍ Frank Drewes; Berthold Hoffmann; Detlef Plump πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 367 KB

When graph transformation is used for programming purposes, large graphs should be structured in order to be comprehensible. In this paper, we present an approach for the rule-based transformation of hierarchically structured hypergraphs. In these graphs, distinguished hyperedges contain graphs that

Hierarchical directed acyclic graph kern
Hierarchical directed acyclic graph kernel
✍ Jun Suzuki; Yutaka Sasaki; Eisaku Maeda πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 607 KB
Graph algebras
Graph algebras
✍ Ki Hang Kim; L Makar-Limanov; Joseph Neggers; Fred W Roush πŸ“‚ Article πŸ“… 1980 πŸ› Elsevier Science 🌐 English βš– 305 KB