Pages that link to "Item:Q1879372"
From MaRDI portal
The following pages link to Characterizations of classes of graphs recognizable by local computations (Q1879372):
Displayed 8 items.
- The computational power of simple protocols for self-awareness on graphs (Q392008) (← links)
- On the power of synchronization between two adjacent processes (Q660989) (← links)
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds (Q1741851) (← links)
- Election in partially anonymous networks with arbitrary knowledge in message passing systems (Q1938371) (← links)
- Sublinear fully distributed partition with applications (Q1959378) (← links)
- A hierarchy of dismantlings in graphs (Q2185916) (← links)
- Labelled (Hyper)Graphs, Negotiations and the Naming Problem (Q3540388) (← links)
- Workshop on Graph Computation Models (Q3540419) (← links)