Pages that link to "Item:Q4818671"
From MaRDI portal
The following pages link to Tree exploration with little memory (Q4818671):
Displaying 25 items.
- Lower and upper competitive bounds for online directed graph exploration (Q343923) (← links)
- Deterministic network exploration by a single agent with Byzantine tokens (Q436569) (← links)
- Collaborative exploration of trees by energy-constrained mobile robots (Q722216) (← links)
- Memory optimal dispersion by anonymous mobile robots (Q831752) (← links)
- How many ants does it take to find the food? (Q896147) (← links)
- Exploring an unknown dangerous graph with a constant number of tokens (Q896695) (← links)
- Fast periodic graph exploration with constant memory (Q931724) (← links)
- Setting port numbers for fast graph exploration (Q935169) (← links)
- Impact of memory size on graph exploration capability (Q947116) (← links)
- Tree exploration with advice (Q958304) (← links)
- Weighted nearest neighbor algorithms for the graph exploration problem on cycles (Q990116) (← links)
- How to meet when you forget: log-space rendezvous in arbitrary graphs (Q1938363) (← links)
- Searching for a black hole in arbitrary networks: optimal mobile agents protocols (Q1954192) (← links)
- Exploring sparse graphs with advice (Q2105435) (← links)
- A tight lower bound for semi-synchronous collaborative grid exploration (Q2220396) (← links)
- Building a nest by an automaton (Q2223695) (← links)
- Computing without communicating: ring exploration by asynchronous oblivious robots (Q2392925) (← links)
- Map construction of unknown graphs by multiple agents (Q2456354) (← links)
- Graph exploration by a finite automaton (Q2575752) (← links)
- EFFICIENT GRID EXPLORATION WITH A STATIONARY TOKEN (Q2929616) (← links)
- Exploration of Faulty Hamiltonian Graphs (Q2970203) (← links)
- (Q5075773) (← links)
- A tight lower bound for semi-synchronous collaborative grid exploration (Q5090903) (← links)
- Memory optimal dispersion by anonymous mobile robots (Q6094723) (← links)
- Edge exploration of anonymous graph by mobile agent with external help (Q6488105) (← links)
