EEMCS EPrints Service
|
||||||||||||||||||||||||||||||||||||||
|
Rensink, A.
(2005)
Time and Space Issues in the Generation of Graph Transition Systems.
In: Proceedings of the International Workshop on Graph-Based Tools (GraBaTs 2004), Barcelona, Spain.
pp. 127-139.
Electronic Notes in Theoretical Computer Science 127 (1).
Elsevier.
ISSN 1571-0661
This is the latest version of this eprint. Full text available as:
Official URL: http://dx.doi.org/10.1016/j.entcs.2004.12.036 ![]() AbstractGROOVE is a tool for the automatic generation of graph transition systems from graph grammars. In this type of tool, both memory and time performance are of prime importance. In this paper we discuss the implementation techniques used for optimising the tool in this regard, and we list possible future improvements.
Available Versions of this Item
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item |
||||||||||||||||||||||||||||||||||||||
