Pages that link to "Item:Q436569"
From MaRDI portal
The following pages link to Deterministic network exploration by a single agent with Byzantine tokens (Q436569):
Displaying 8 items.
- Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots (Q820545) (← links)
- Exploring an unknown dangerous graph with a constant number of tokens (Q896695) (← links)
- Exploration of dynamic networks: tight bounds on the number of agents (Q2229946) (← links)
- Rendezvous in networks in spite of delay faults (Q2629214) (← links)
- Efficient grid exploration with a stationary token (Q2929616) (← links)
- Exploration of Faulty Hamiltonian Graphs (Q2970203) (← links)
- Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports (Q4962168) (← links)
- Invited paper: One bit agent memory is enough for snap-stabilizing perpetual exploration of cactus graphs with distinguishable cycles (Q6155234) (← links)