A computational model for generic graph functions
From MaRDI portal
Recommendations
- A functional approach to the representation of graphs
- Graph-theoretical methods in general function theory
- A graph model for imperative computation
- A general theory of graph representations
- Inductive graphs and functional graph algorithms
- scientific article; zbMATH DE number 910723
- scientific article; zbMATH DE number 1305093
- A functional approach to external graph algorithms
- Generalized homomorphism graph functions
- scientific article; zbMATH DE number 46126
Cites work
- scientific article; zbMATH DE number 1256674 (Why is no real title available?)
- Datalog extensions for database queries and updates
- Descriptive characterizations of computational complexity
- Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings
- On a hierarchy of classes for nested databases
- Storage Modification Machines
Cited in
(9)- Graph Turing machines
- Turing machines on Cayley graphs
- scientific article; zbMATH DE number 4026840 (Why is no real title available?)
- scientific article; zbMATH DE number 6456807 (Why is no real title available?)
- A functional approach to the representation of graphs
- scientific article; zbMATH DE number 1505867 (Why is no real title available?)
- scientific article; zbMATH DE number 1305093 (Why is no real title available?)
- Function simulation, graph grammars and colourings
- Time and space measures for a complete graph computation model
This page was built for publication: A computational model for generic graph functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096281)
