Pages that link to "Item:Q5175104"
From MaRDI portal
The following pages link to Deterministic Rendezvous in Restricted Graphs (Q5175104):
Displaying 7 items.
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms (Q1699417) (← links)
- How to meet when you forget: log-space rendezvous in arbitrary graphs (Q1938363) (← links)
- Deterministic rendezvous with different maps (Q2323344) (← links)
- Asynchronous deterministic rendezvous in graphs (Q2369001) (← links)
- Distributed Evacuation in Graphs with Multiple Exits (Q2835028) (← links)
- On the probability of rendezvous in graphs (Q4680409) (← links)
- Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs (Q6116185) (← links)