A computational model for generic graph functions

DOI10.1007/3-540-57787-4_11zbMath1494.68081OpenAlexW1546896155MaRDI QIDQ5096281

M. Gemis, Peter Peelman, Jan Van den Bussche, Jan Paredaens

Publication date: 16 August 2022

Published in: Graph Transformations in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-57787-4_11

Mathematics Subject Classification ID

Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10) Classical models of computation (Turing machines, etc.) (68Q04)

Cites Work

• Unnamed Item
• On a hierarchy of classes for nested databases
• Descriptive characterizations of computational complexity
• Datalog extensions for database queries and updates
• Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings
• Storage Modification Machines

This page was built for publication: A computational model for generic graph functions