A Note on an Old-Fashioned Algebra for (Disconnected) Graphs

DOI10.1016/j.entcs.2009.10.014zbMath1291.68219OpenAlexW2004299514MaRDI QIDQ5170278

Fabio Gadducci

Publication date: 23 July 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.10.014

zbMATH Keywords

disconnected graphsDPO approachparallel derivationsalgebraic presentation of graphs

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A functorial semantics for multi-algebras and partial algebras, with applications to syntax.
• A Survey of Graphical Languages for Monoidal Categories
• Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
• Calculating Colimits Compositionally
• Rewriting on cyclic structures: Equivalence between the operational and the categorical description
• Graph rewriting for the π-calculus
• Adhesive and quasiadhesive categories

This page was built for publication: A Note on an Old-Fashioned Algebra for (Disconnected) Graphs