The following pages link to Graph Transformations (Q5292599):
Displaying 13 items.
- Distributed enumeration (Q287005) (← links)
- Computing role assignments of split graphs (Q287443) (← links)
- On the power of synchronization between two adjacent processes (Q660989) (← links)
- Election and rendezvous with incomparable labels (Q930904) (← links)
- Election in partially anonymous networks with arbitrary knowledge in message passing systems (Q1938371) (← links)
- Analysis of fully distributed splitting and naming probabilistic procedures and applications (Q2345463) (← links)
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree (Q2348037) (← links)
- Locally constrained graph homomorphisms and equitable partitions (Q2427537) (← links)
- Graph labelings derived from models in distributed computing: A complete complexity classification (Q3100700) (← links)
- Labelled (Hyper)Graphs, Negotiations and the Naming Problem (Q3540388) (← links)
- Foundations of Software Science and Computation Structures (Q5308444) (← links)
- Experimental and Efficient Algorithms (Q5710027) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711520) (← links)