Graph Transformations
From MaRDI portal
Publication:5292599
DOI10.1007/B100934zbMATH Open1116.68548OpenAlexW4214712303MaRDI QIDQ5292599FDOQ5292599
Authors: J. Chalopin, Wiesław Zielonka, Yves Métivier 
Publication date: 21 June 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100934
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42) Network design and communication in computer systems (68M10) Distributed systems (68M14)
Cited In (15)
- Election in partially anonymous networks with arbitrary knowledge in message passing systems
- Experimental and Efficient Algorithms
- Graph labelings derived from models in distributed computing: A complete complexity classification
- Title not available (Why is that?)
- Computing role assignments of split graphs
- Labelled (Hyper)Graphs, Negotiations and the Naming Problem
- Locally constrained graph homomorphisms and equitable partitions
- Local computations in graphs: the case of cellular edge local computations
- Analysis of fully distributed splitting and naming probabilistic procedures and applications (extended abstract)
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
- Foundations of Software Science and Computation Structures
- Universal semi-local election protocol using forward links
- Election and rendezvous with incomparable labels
- SOFSEM 2005: Theory and Practice of Computer Science
- On the power of synchronization between two adjacent processes
This page was built for publication: Graph Transformations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5292599)
