This is a preview of subscription content, log in via an institution.
References
M. Billaud, Some Backtracking Graph Algorithms expressed by Graph Rewriting Systems with Priorities, Internal Report LABRI no 8989.
M. Billaud, Un Interpréteur pour les Systèmes de Réécriture de Graphes avec Priorités, Internal Report LABRI no 9040 (in french).
M. Billaud, P. Lafon, Y. Métivier, E. Sopena, Graph Rewriting Systems with Priorities, in Graph-theoretic Concepts in Computer Science, 15th Workshop on Graphs'89, LNCS 411, pp. 94–106.
J.L. Lafaye, Mémoire pour l'Obtention du D.U.T., Département Informatique, IUT'A', Université Bordeaux I (1990).
I. Litovsky, Y. Métivier, Graph Rewriting Systems as a Tool to design and to prove Graph and Network Algorithms, Internal Report LABRI no 9070.
I. Litovsky, Y. Métivier, Computing Trees with Graph Rewriting Systems with Priorities, Internal Report LABRI no 9085.
I. Litovsky, Y. Métivier, Computing with Graph Rewriting Systems with Priorities, Fourth International Workshop on Graph Grammars and Their Applications to Computer Science, Bremen (1990). Also Report LABRI no 9087.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Billaud, M. (1991). ANIGRAF: An interactive system for the animation of graph rewriting systems with priorities. In: Book, R.V. (eds) Rewriting Techniques and Applications. RTA 1991. Lecture Notes in Computer Science, vol 488. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53904-2_117
Download citation
DOI: https://doi.org/10.1007/3-540-53904-2_117
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53904-9
Online ISBN: 978-3-540-46383-2
eBook Packages: Springer Book Archive