Hierarchical Graph Transformation Revisited

DOI10.1007/978-3-319-61470-0_2zbMath1425.68171OpenAlexW2639154722MaRDI QIDQ4972007

Julia Padberg

Publication date: 22 November 2019

Published in: Graph Transformation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-61470-0_2

zbMATH Keywords

graphcoalgebrahierarchy\( \mathcal{M} \)-adhesive transformation system

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30)

Related Items (3)

Fundamentals of compositional rewriting theory ⋮ A new criterion for \(\mathcal{M}, \mathcal{N} \)-adhesivity, with an application to hierarchical graphs ⋮ A simple criterion for \(\mathcal{M}, \mathcal{N}\)-adhesivity

This page was built for publication: Hierarchical Graph Transformation Revisited