Group based graph transformations and hierarchical representations of graphs
From MaRDI portal
Recommendations
Cites work
- A Fast Algorithm for the Decomposition of Graphs and Posets
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
- Dynamic labeled 2-structures
- scientific article; zbMATH DE number 3412857 (Why is no real title available?)
- Invariants of inversive 2-structures on groups of labels
- Permutable transformation semigroups
- Theory of 2-structures. I: Clans, basic subclasses, and morphisms
Cited in
(4)- Incremental construction of 2-structures
- scientific article; zbMATH DE number 1512612 (Why is no real title available?)
- Comparing Notions of Hierarchical Graph Transformation1 1This work has been partially supported by the ESPRIT Working Group Applications of Graph Transformation (Appligraph).
- Dynamic labeled 2-structures with variable domains
This page was built for publication: Group based graph transformations and hierarchical representations of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645297)