Exploring Unknown Undirected Graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1303571
- scientific article; zbMATH DE number 5263405
- Exploring an unknown graph
- Algorithms – ESA 2005
- Learning unknown graphs
- Stochastic graph exploration
- Structural Information and Communication Complexity
- Finding patterns in an unknown graph
- On a simple depth-first search strategy for exploring unknown graphs
Cited in
(70)- Deterministic broadcasting time with partial knowledge of the network.
- Online graph exploration: New results on old and new algorithms
- Searching for a black hole in arbitrary networks: optimal mobile agents protocols
- Graph exploration by energy-sharing mobile agents
- Exploring a dynamic ring without landmark
- Distributed exploration of dynamic rings
- Exploration of carrier-based time-varying networks: the power of waiting
- Building a nest by an automaton
- Exploration of dynamic networks: tight bounds on the number of agents
- Online graph exploration algorithms for cycles and trees by multiple searchers
- Fast collaborative graph exploration
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Collision-free network exploration
- The ANTS problem
- Searching without communicating: tradeoffs between performance and selection complexity
- Fibonacci helps to evacuate from a convex region in a grid network
- Simple agents learn to find their way: an introduction on mapping polygons
- Map construction of unknown graphs by multiple agents
- Graph exploration by a finite automaton
- Grid exploration by a swarm of autonomous robots with minimum repetitions
- Efficient communication in unknown networks
- Unravelling tangled graphs
- Efficient grid exploration with a stationary token
- Optimal constrained graph exploration
- Exploration of Faulty Hamiltonian Graphs
- Online Graph Exploration: New Results on Old and New Algorithms
- Chaotic traversal (CHAT): very large graphs traversal using chaotic dynamics
- Finding patterns in an unknown graph
- More efficient periodic traversal in anonymous undirected graphs
- Black hole search in directed graphs
- OPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENT
- Collaborative Exploration by Energy-Constrained Mobile Robots
- Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
- scientific article; zbMATH DE number 1303571 (Why is no real title available?)
- Impact of topographic information on graph exploration efficiency
- scientific article; zbMATH DE number 1559557 (Why is no real title available?)
- Exploring an unknown graph
- Brief announcement: Energy constrained depth first search
- Building a nest by an automaton
- Exploration of Time-Varying Connected Graphs with Silent Agents
- scientific article; zbMATH DE number 5263405 (Why is no real title available?)
- Algorithms – ESA 2005
- Connected reconfiguration of lattice-based cellular structures by finite-memory robots
- Time versus cost tradeoffs for deterministic rendezvous in networks
- Efficient live exploration of a dynamic ring with mobile robots
- Memory optimal dispersion by anonymous mobile robots
- 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
- Exploring a Dynamic Ring Without Landmark
- Graph exploration by a deterministic memoryless automaton with pebbles
- Learning to act and observe in partially observable domains
- Energy constrained depth first search
- 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
- Optimal graph exploration without good maps
- Collaborative exploration of trees by energy-constrained mobile robots
- Near-linear time dispersion of mobile agents
- An improved online evacuation strategy from a convex region on grid networks
- Self-stabilizing graph exploration by a single agent
- Performance bounds for planning in unknown terrain
- Memory optimal dispersion by anonymous mobile robots
- Fault-tolerant sequential scan
- 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
- Remembering without memory: tree exploration by asynchronous oblivious robots
This page was built for publication: Exploring Unknown Undirected Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4935310)
