Pages that link to "Item:Q2575752"
From MaRDI portal
The following pages link to Graph exploration by a finite automaton (Q2575752):
Displaying 50 items.
- A probabilistic model for the interaction of an agent with a network environment (Q269125) (← links)
- Lower and upper competitive bounds for online directed graph exploration (Q343923) (← links)
- Derandomizing random walks in undirected graphs using locally fair exploration strategies (Q661051) (← links)
- Graph automata: Natural expression of self-reproduction (Q700838) (← links)
- Collaborative exploration of trees by energy-constrained mobile robots (Q722216) (← links)
- Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots (Q820545) (← links)
- An improved lower bound for competitive graph exploration (Q831137) (← 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)
- Distributed chasing of network intruders (Q930899) (← links)
- Fast periodic graph exploration with constant memory (Q931724) (← links)
- Impact of memory size on graph exploration capability (Q947116) (← links)
- Anonymous graph exploration without collision by mobile robots (Q975538) (← links)
- Recognition of graphs by automata (Q1349690) (← links)
- State complexity of union and intersection on graph-walking automata (Q2096590) (← links)
- Dispersion of mobile robots on directed anonymous graphs (Q2097347) (← links)
- Two-agent tree evacuation (Q2117727) (← links)
- Homomorphisms on graph-walking automata (Q2164747) (← links)
- Exploring a dynamic ring without landmark (Q2166751) (← links)
- Distributed exploration of dynamic rings (Q2174251) (← links)
- On defining linear orders by automata (Q2211260) (← links)
- Reversibility of computations in graph-walking automata (Q2216129) (← links)
- Building a nest by an automaton (Q2223695) (← links)
- Exploration of dynamic networks: tight bounds on the number of agents (Q2229946) (← links)
- Distributed graph searching with a sense of direction (Q2355324) (← links)
- Collision-free network exploration (Q2396820) (← links)
- Time and space optimality of rotor-router graph exploration (Q2398496) (← links)
- The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks (Q2407630) (← links)
- Robustness of the rotor-router mechanism (Q2408092) (← links)
- Ping pong in dangerous graphs: optimal black hole search with pebbles (Q2429323) (← links)
- Graph decomposition for memoryless periodic exploration (Q2429354) (← links)
- State complexity of transforming graph-walking automata to halting, returning and reversible (Q2687992) (← links)
- Time optimal algorithms for black hole search in rings (Q2905278) (← links)
- Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics (Q3132937) (← links)
- Graph Decomposition for Improving Memoryless Periodic Exploration (Q3182950) (← links)
- More Efficient Periodic Traversal in Anonymous Undirected Graphs (Q3408168) (← links)
- Black Hole Search in Directed Graphs (Q3408170) (← links)
- An Improved Strategy for Exploring a Grid Polygon (Q3408174) (← links)
- Collaborative Exploration by Energy-Constrained Mobile Robots (Q3460728) (← links)
- On the Power of Local Orientations (Q3511395) (← links)
- Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens (Q3540233) (← links)
- (Q4544435) (← links)
- Tree exploration with little memory (Q4818671) (← links)
- LABEL-GUIDED GRAPH EXPLORATION WITH ADJUSTABLE RATIO OF LABELS (Q4902885) (← links)
- Shape recognition by a finite automaton robot (Q5005154) (← links)
- (Q5075773) (← links)
- Exploration of High-Dimensional Grids by Finite Automata (Q5092342) (← links)
- Exploration of Time-Varying Connected Graphs with Silent Agents (Q5100956) (← links)
- Memory Efficient Anonymous Graph Exploration (Q5302040) (← links)
- STACS 2004 (Q5309704) (← links)
