Graph Transformations
From MaRDI portal
Publication:5292599
Recommendations
Cited in
(17)- Election and rendezvous with incomparable labels
- Analysis of fully distributed splitting and naming probabilistic procedures and applications (extended abstract)
- Universal semi-local election protocol using forward links
- Distributed enumeration
- Computing role assignments of split graphs
- Election in partially anonymous networks with arbitrary knowledge in message passing systems
- scientific article; zbMATH DE number 2087429 (Why is no real title available?)
- Experimental and Efficient Algorithms
- SOFSEM 2005: Theory and Practice of Computer Science
- Graph labelings derived from models in distributed computing: A complete complexity classification
- Locally constrained graph homomorphisms and equitable partitions
- On the power of synchronization between two adjacent processes
- Foundations of Software Science and Computation Structures
- Local computations in graphs: the case of cellular edge local computations
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
- Labelled (Hyper)Graphs, Negotiations and the Naming Problem
- Analysis of fully distributed splitting and naming probabilistic procedures and applications
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)