scientific article; zbMATH DE number 1775412
From MaRDI portal
Publication:4542545
zbMATH Open1027.68652MaRDI QIDQ4542545FDOQ4542545
Authors:
Publication date: 17 September 2002
Title of this publication is not available (Why is that?)
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
- Fast rendezvous on a cycle by agents with different speeds
- Information spreading by mobile particles on a line
- Fault-tolerant sequential scan
- Map construction of unknown graphs by multiple agents
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Remembering without memory: tree exploration by asynchronous oblivious robots
- Black hole search in directed graphs
- Deterministic network exploration by a single agent with Byzantine tokens
- Tight bounds for undirected graph exploration with pebbles and multiple agents
- Collaborative exploration of trees by energy-constrained mobile robots
- 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
- Simple agents learn to find their way: an introduction on mapping polygons
- Optimal graph exploration without good maps
- Searching on a line: a complete characterization of the optimal solution
- The power of a pebble: Exploring and mapping directed graphs
- Efficient pebbling for list traversal synopses with application to program rollback
- Mapping a polygon with holes using a compass
- Robot map verification of a graph world
- Mapping a Polygon with Holes Using a Compass
- Searching without communicating: tradeoffs between performance and selection complexity
- Collective tree exploration
- Distributed chasing of network intruders
- On the Power of Local Orientations
- Collaborative Exploration by Energy-Constrained Mobile Robots
- The Magnus-Derek game
- Graph covering using bounded size subgraphs
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)
