We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: two terms are equated exactly when they represent the same graph. Our algebra can be understood as a high-level language for describing graphs with a node-sharing, embedding structure, and it is then well suited for defining graphical representations of software models where nesting and linking are key aspects. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Bruni, R., Gadducci, F., & Lluch Lafuente, A. (2010). An algebra of hierarchical graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6084 LNCS, pp. 205–221). https://doi.org/10.1007/978-3-642-15640-3_14
Mendeley helps you to discover research relevant for your work.