scientific article; zbMATH DE number 1775412
From MaRDI portal
Publication:4542545
Recommendations
- The power of a pebble: Exploring and mapping directed graphs
- scientific article; zbMATH DE number 1439473
- Mapping directed networks
- A note on graph pebbling
- Pebbling graphs
- Undirected Graph Exploration with ⊝(log log n) Pebbles
- scientific article; zbMATH DE number 1998296
- The Complexity of Graph Pebbling
Cited in
(29)- A general framework for searching on a line
- The power of a pebble: Exploring and mapping directed graphs
- How many oblivious robots can explore a line
- Searching for a black hole in arbitrary networks: optimal mobile agents protocols
- Dispersion of mobile robots on directed anonymous graphs
- Fast rendezvous on a cycle by agents with different speeds
- Efficient pebbling for list traversal synopses with application to program rollback
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Searching without communicating: tradeoffs between performance and selection complexity
- Simple agents learn to find their way: an introduction on mapping polygons
- Map construction of unknown graphs by multiple agents
- The Magnus-Derek game
- Searching on a line: a complete characterization of the optimal solution
- Black hole search in directed graphs
- Collective tree exploration
- Information spreading by mobile particles on a line
- Collaborative Exploration by Energy-Constrained Mobile Robots
- On the Power of Local Orientations
- Deterministic network exploration by a single agent with Byzantine tokens
- Tight bounds for undirected graph exploration with pebbles and multiple agents
- Mapping a Polygon with Holes Using a Compass
- Robot map verification of a graph world
- Graph covering using bounded size subgraphs
- Optimal graph exploration without good maps
- Collaborative exploration of trees by energy-constrained mobile robots
- Mapping a polygon with holes using a compass
- Fault-tolerant sequential scan
- Distributed chasing of network intruders
- Remembering without memory: tree exploration by asynchronous oblivious robots
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542545)
