Pages that link to "Item:Q2971126"
From MaRDI portal
The following pages link to Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs (Q2971126):
Displaying 6 items.
- Byzantine gathering in polynomial time (Q2146872) (← links)
- Searching for a non-adversarial, uncooperative agent on a cycle (Q2285151) (← links)
- (Q5002836) (← links)
- Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults (Q5056052) (← links)
- Searching for a Non-adversarial, Uncooperative Agent on a Cycle (Q5056057) (← links)
- Optimal rendezvous on a line by location-aware robots in the presence of spies* (Q5057736) (← links)
