Computing with graph relabelling systems with priorities-Reference-Cited by-同舟云学术

Computing with graph relabelling systems with priorities

Published:1991 Issue: Volume: Page:549-563
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Litovsky Igor,Métivier Yves

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0017412

Reference20 articles.

1. M. Billaud, Some Backtracking Graphs Algorithms expressed by Graph Rewriting Systems with Priorities, Rapport Interne no 8989, LaBRI, Univ. Bordeaux I.

2. M. Billaud, Un interpréteur pour les Systèmes de Réécriture de Graphes avec Priorités, Rapport Interne no 9040, LaBRI, Univ. Bordeaux I.

3. M. Billaud, P. Lafon, Y. Métivier and E. Sopena, Graph Rewriting Systems with Priorities: Definitions and Applications, Rapport Interne no 8909, LaBRI, Univ. Bordeaux I.

4. M. Billaud, P. Lafon, Y. Métivier and E. Sopena, Graph Rewriting Systems with Priorities, in Graph-Theoretic Concepts in Computer Science, 15th Workshop on Graphs'89, LNCS no 411, pp. 94–106.

5. B. Courcelle, Some applications of logic of universal algebra, and of category theory to the theory of graph transformations, Bulletin of E.A.T.C.S. no 36 (1988), pp. 161–218.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. High-Level Approach for the Reconfiguration of Distributed Algorithms in Wireless Sensor Networks;Advanced Information Networking and Applications;2021

2. The power and the limitations of local computations on graphs;Graph-Theoretic Concepts in Computer Science;1993

3. Definitions and comparisons of local computations on graphs;Mathematical Foundations of Computer Science 1992;1992

4. The ANIGRAF system;STACS 92;1992

5. ANIGRAF: An interactive system for the animation of graph rewriting systems with priorities;Rewriting Techniques and Applications;1991