Pages that link to "Item:Q4962747"
From MaRDI portal
The following pages link to Label-guided graph exploration by a finite automaton (Q4962747):
Displaying 15 items.
- Topology recognition with advice (Q259077) (← links)
- Computing on rings by oblivious robots: a unified approach for different tasks (Q494795) (← links)
- Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots (Q820545) (← links)
- Memory optimal dispersion by anonymous mobile robots (Q831752) (← links)
- Fast rendezvous with advice (Q896137) (← links)
- Dispersion of mobile robots on directed anonymous graphs (Q2097347) (← links)
- Pebble guided near optimal treasure hunt in anonymous graphs (Q2117728) (← links)
- Byzantine gathering in polynomial time (Q2146872) (← links)
- Exploration of dynamic networks: tight bounds on the number of agents (Q2229946) (← links)
- Toward more localized local algorithms: removing assumptions concerning global knowledge (Q2441787) (← links)
- Finding the size and the diameter of a radio network using short labels (Q2661761) (← links)
- Lower and upper bounds for deterministic convergecast with labeling schemes (Q2693630) (← links)
- (Q5002836) (← links)
- Memory optimal dispersion by anonymous mobile robots (Q6094723) (← links)
- Edge exploration of anonymous graph by mobile agent with external help (Q6488105) (← links)
