Advertisement

The ANIGRAF system

  • Michel Billaud
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 577)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M. Billaud, Some Backtracking Graph Algorithms expressed by Graph Rewriting Systems with Priorities, Report LABRI 8989.Google Scholar
  2. [2]
    M. Billaud, Un Interpréteur pour les Systèmes de Réécriture de Graphes avec Priorités, Report LABRI 9040 (in french).Google Scholar
  3. [3]
    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.Google Scholar
  4. [4]
    J.L. Lafaye, Mémoire pour l'Obtention du D.U.T., Département Informatique de l'IUT ‘A', Université Bordeaux I (1990).Google Scholar
  5. [5]
    I. Litovsky, Y. Métivier, Graph Rewriting Systems as a Tool to design and to prove Graph and Network Algorithms, Report LABRI 9070.Google Scholar
  6. [6]
    I. Litovsky, Y. Métivier, Computing Trees with Graph Rewriting Systems with Priorities, Report LABRI 9085.Google Scholar
  7. [7]
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Michel Billaud
    • 1
  1. 1.LaBRI - Université Bordeaux ITalence CedexFrance

Personalised recommendations