scientific article; zbMATH DE number 1303571
From MaRDI portal
Publication:4250197
zbMATH Open0942.68089MaRDI QIDQ4250197FDOQ4250197
Authors: Petrişor Panaite, Andrzej Pelc 
Publication date: 17 June 1999
Title of this publication is not available (Why is that?)
Recommendations
Cited In (29)
- Exploring Unknown Undirected Graphs
- Title not available (Why is that?)
- A tight lower bound for semi-synchronous collaborative grid exploration
- Unravelling tangled graphs
- A tight lower bound for semi-synchronous collaborative grid exploration
- Dynamic graph-based search in unknown environments
- Beyond rings: gathering in 1-interval connected graphs
- Searching with mobile agents in networks with liars.
- Title not available (Why is that?)
- Optimal graph exploration without good maps
- Title not available (Why is that?)
- Piecemeal graph exploration by a mobile robot.
- The power of a pebble: Exploring and mapping directed graphs
- Title not available (Why is that?)
- Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory
- How many ants does it take to find the food?
- Exploring Unknown Environments
- Efficient exploration of anonymous undirected graphs
- Algorithms – ESA 2005
- On the Power of Local Orientations
- On a simple depth-first search strategy for exploring unknown graphs
- Traversal of an unknown directed graph by a finite robot
- Optimal constrained graph exploration
- Assigning labels in an unknown anonymous network with a leader
- Tight bounds for deterministic high-dimensional grid exploration
- Graph exploration with robot swarms
- Impact of topographic information on graph exploration efficiency
- Exploring an unknown graph
- Finding patterns in an unknown graph
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 Q4250197)
