Graph Relabelling Systems

DOI10.1016/S1571-0661(04)80194-4zbMath1263.68066OpenAlexW3023534383MaRDI QIDQ4923532

Michel Bauderon, Afif Sellami, Mohamed Mosbah, Yves Métivier

Publication date: 24 May 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80194-4

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Distributed algorithms (68W15)

Related Items (3)

Mobile Agents Implementing Local Computations in Graphs ⋮ Workshop on Graph Computation Models ⋮ GETGRATS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed enumeration
• Some remarks on the Kronecker product of graphs
• Easy impossibility proofs for distributed consensus problems
• Computing with graph rewriting systems with priorities
• Formal description techniques and protocol specification, testing and verification. FORTE XI/ PSTV XVIII '98. IFIP TC6 WG6. 1 joint international conference on Formal description techniques for distributed systems and communication protocols (FORTE XI) and protocol specification, testing and verification (PSTV XVIII), Paris, France, November 3--6, 1998
• Coverings and minors: Application to local computations in graphs
• On the recognition of families of graphs with local computations
• Simulation of large networks on smaller networks
• Different local controls for graph relabeling systems
• Introduction to Distributed Algorithms
• The Kronecker product and local computations in graphs

This page was built for publication: Graph Relabelling Systems