Open AccessA Note on an Old-Fashioned Algebra for (Disconnected) Graphs
Author(s) -
Fabio Gadducci
Publication year - 2009
Publication title -
electronic notes in theoretical computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.242
H-Index - 60
ISSN - 1571-0661
DOI - 10.1016/j.entcs.2009.10.014
Subject(s) - morphism , graph rewriting , rewriting , graph , simple (philosophy) , computer science , graph product , enhanced data rates for gsm evolution , mathematics , discrete mathematics , combinatorics , line graph , pathwidth , programming language , artificial intelligence , philosophy , epistemology
Graphs with interfaces are a simple and intuitive tool for allowing a graph G to interact with the environment, by equipping it with two morphisms J → G, I → G. These “handles” were used to define graphical operators, and to provide an inductive presentation of graph rewriting. A main feature of graphs with interfaces is their characterization as terms of a free algebra. So far, this was possible only with discrete interfaces, i.e., containing no edge. This note shows that a similar free construction can be performed also with disconnected interfaces, i.e., containing only nodes connected to at most one edge
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom