Exploring Unknown Undirected Graphs
From MaRDI portal
Publication:4935310
DOI10.1006/jagm.1999.1043zbMath0957.68092OpenAlexW2017716370MaRDI QIDQ4935310
Petrişor Panaite, Andrzej Pelc
Publication date: 19 March 2000
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1999.1043
Related Items (53)
Memory optimal dispersion by anonymous mobile robots ⋮ OPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENT ⋮ Fault-tolerant sequential scan ⋮ Collaborative Exploration by Energy-Constrained Mobile Robots ⋮ Computing without communicating: ring exploration by asynchronous oblivious robots ⋮ Collision-free network exploration ⋮ EFFICIENT GRID EXPLORATION WITH A STATIONARY TOKEN ⋮ Exploring a dynamic ring without landmark ⋮ The ANTS problem ⋮ Searching without communicating: tradeoffs between performance and selection complexity ⋮ Distributed exploration of dynamic rings ⋮ Fibonacci helps to evacuate from a convex region in a grid network ⋮ Online graph exploration: New results on old and new algorithms ⋮ Exploration of Time-Varying Connected Graphs with Silent Agents ⋮ Grid exploration by a swarm of autonomous robots with minimum repetitions ⋮ Efficient live exploration of a dynamic ring with mobile robots ⋮ Exploring an unknown dangerous graph with a constant number of tokens ⋮ Deterministic broadcasting time with partial knowledge of the network. ⋮ Graph covering using bounded size subgraphs ⋮ Invited paper: One bit agent memory is enough for snap-stabilizing perpetual exploration of cactus graphs with distinguishable cycles ⋮ Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots ⋮ Unnamed Item ⋮ Exploration of carrier-based time-varying networks: the power of waiting ⋮ Exploration of Faulty Hamiltonian Graphs ⋮ Searching for a black hole in arbitrary networks: optimal mobile agents protocols ⋮ Simple agents learn to find their way: an introduction on mapping polygons ⋮ Building a nest by an automaton ⋮ Fast periodic graph exploration with constant memory ⋮ Map construction of unknown graphs by multiple agents ⋮ Setting port numbers for fast graph exploration ⋮ Exploration of dynamic networks: tight bounds on the number of agents ⋮ Memory optimal dispersion by anonymous mobile robots ⋮ Impact of memory size on graph exploration capability ⋮ Online Graph Exploration: New Results on Old and New Algorithms ⋮ Efficient communication in unknown networks ⋮ Tree exploration with advice ⋮ Online graph exploration algorithms for cycles and trees by multiple searchers ⋮ Remembering without memory: tree exploration by asynchronous oblivious robots ⋮ Optimal graph exploration without good maps ⋮ Unnamed Item ⋮ Impact of topographic information on graph exploration efficiency ⋮ Collaborative exploration of trees by energy-constrained mobile robots ⋮ An improved online evacuation strategy from a convex region on grid networks ⋮ Time versus cost tradeoffs for deterministic rendezvous in networks ⋮ Connected reconfiguration of lattice-based cellular structures by finite-memory robots ⋮ Collaborative delivery with energy-constrained mobile robots ⋮ More Efficient Periodic Traversal in Anonymous Undirected Graphs ⋮ Black Hole Search in Directed Graphs ⋮ Graph exploration by a finite automaton ⋮ Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics ⋮ Fast collaborative graph exploration ⋮ Performance bounds for planning in unknown terrain ⋮ Graph exploration by energy-sharing mobile agents
This page was built for publication: Exploring Unknown Undirected Graphs
