Preview
Unable to display preview. Download preview PDF.
References
M. Billaud, Some Backtracking Graph Algorithms expressed by Graph Rewriting Systems with Priorities, Report LABRI 8989.
M. Billaud, Un Interpréteur pour les Systèmes de Réécriture de Graphes avec Priorités, Report LABRI 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 de l'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, Report LABRI 9070.
I. Litovsky, Y. Métivier, Computing Trees with Graph Rewriting Systems with Priorities, Report LABRI 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 9087.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Billaud, M. (1992). The ANIGRAF system. In: Finkel, A., Jantzen, M. (eds) STACS 92. STACS 1992. Lecture Notes in Computer Science, vol 577. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55210-3_216
Download citation
DOI: https://doi.org/10.1007/3-540-55210-3_216
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55210-9
Online ISBN: 978-3-540-46775-5
eBook Packages: Springer Book Archive