Skip to main content
Conference ProceedingsOPEN ACCESS

Algebraic graph rewriting using a single pushout

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1991) 493 LNCS 90-102
DOI: 10.1007/3-540-53982-4_6
8Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We show how graph rewriting can be described with a single pushout in a suitable category of graphs, and compare our result with the conventional approach which uses double pushouts.

Cite

CITATION STYLE

APA

van den Broek, P. M. (1991). Algebraic graph rewriting using a single pushout. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 493 LNCS, pp. 90–102). Springer Verlag. https://doi.org/10.1007/3-540-53982-4_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free