The power of a pebble: Exploring and mapping directed graphs
From MaRDI portal
Recommendations
Cites work
- Diversity-based inference of finite automata
- Efficient learning of typical finite automata from random walks
- How to learn an unknown environment. I
- scientific article; zbMATH DE number 2185605 (Why is no real title available?)
- scientific article; zbMATH DE number 3598362 (Why is no real title available?)
- scientific article; zbMATH DE number 1256766 (Why is no real title available?)
- scientific article; zbMATH DE number 1303571 (Why is no real title available?)
- scientific article; zbMATH DE number 1559557 (Why is no real title available?)
- scientific article; zbMATH DE number 1775412 (Why is no real title available?)
- scientific article; zbMATH DE number 871902 (Why is no real title available?)
- scientific article; zbMATH DE number 6472590 (Why is no real title available?)
- Inference of finite automata using homing sequences
- Learning regular sets from queries and counterexamples
- Navigating in Unfamiliar Geometric Terrain
- On behaviour of automata in labyrinths
- Online Navigation in a Room
- Piecemeal graph exploration by a mobile robot.
- Searching in the plane
- Shortest paths without a map
Cited in
(45)- Graph searching with advice
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
- Linear search by a pair of distinct-speed robots
- Exploring sparse graphs with advice
- Building a nest by an automaton
- Fast collaborative graph exploration
- Robustness of the rotor-router mechanism
- Ping pong in dangerous graphs: optimal black hole search with pebbles
- Graph exploration by a finite automaton
- Convergecast and broadcast by power-aware mobile agents
- Grid exploration by a swarm of autonomous robots with minimum repetitions
- Linear search by a pair of distinct-speed robots
- Time optimal algorithms for black hole search in rings
- Exploration of Faulty Hamiltonian Graphs
- More efficient periodic traversal in anonymous undirected graphs
- Lower and upper competitive bounds for online directed graph exploration
- OPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENT
- Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
- Graph exploration with robot swarms
- Drawing maps with advice
- Mapping in unknown graph-like worlds
- scientific article; zbMATH DE number 1775412 (Why is no real title available?)
- LABEL-GUIDED GRAPH EXPLORATION WITH ADJUSTABLE RATIO OF LABELS
- Building a nest by an automaton
- Exploration of High-Dimensional Grids by Finite Automata
- Memory Efficient Anonymous Graph Exploration
- Trade-offs between the size of advice and broadcasting time in trees
- Wireless evacuation on \(m\) rays with \(k\) searchers
- A general lower bound for collaborative tree exploration
- Time versus cost tradeoffs for deterministic rendezvous in networks
- Edge exploration of anonymous graph by mobile agent with external help
- Exploration of High-Dimensional Grids by Finite State Machines
- Graph exploration by a deterministic memoryless automaton with pebbles
- Derandomizing random walks in undirected graphs using locally fair exploration strategies
- Exploration of convex terrains by a deterministic automaton with pebbles
- Graph exploration: the impact of a distance constraint
- Collision-free exploration by mobile agents using pebbles
- Exploring wedges of an oriented grid by an automaton with pebbles
- Graph exploration: the impact of a distance constraint
- Exploring an unknown dangerous graph with a constant number of tokens
- Fast periodic graph exploration with constant memory
- Setting port numbers for fast graph exploration
- Impact of memory size on graph exploration capability
- Tree exploration with advice
- Communication algorithms with advice
This page was built for publication: The power of a pebble: Exploring and mapping directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854539)
