Exploring an unknown graph
From MaRDI portal
Recommendations
Cited in
(64)- Approximate sequencing for variable length tasks.
- 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
- A tight lower bound for semi-synchronous collaborative grid exploration
- 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
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Robustness of the rotor-router mechanism
- Ping pong in dangerous graphs: optimal black hole search with pebbles
- Map construction of unknown graphs by multiple agents
- Graph exploration by a finite automaton
- Convergecast and broadcast by power-aware mobile agents
- Time optimal algorithms for black hole search in rings
- Efficient grid exploration with a stationary token
- Exploration of Faulty Hamiltonian Graphs
- Black hole search with finite automata scattered in a synchronous torus
- Finding patterns in an unknown graph
- More efficient periodic traversal in anonymous undirected graphs
- Lower and upper competitive bounds for online directed graph exploration
- OPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENT
- On the Power of Local Orientations
- Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
- scientific article; zbMATH DE number 3914345 (Why is no real title available?)
- Tight bounds for black hole search with scattered agents in synchronous rings
- Drawing maps with advice
- Deterministic network exploration by a single agent with Byzantine tokens
- The \(k\)-server problem
- Exploring Unknown Undirected Graphs
- Average Costs of a Graph Exploration: Upper and Lower Bounds
- Building a nest by an automaton
- A tight lower bound for semi-synchronous collaborative grid exploration
- On a simple depth-first search strategy for exploring unknown graphs
- Exploration of Time-Varying Connected Graphs with Silent Agents
- Memory Efficient Anonymous Graph Exploration
- scientific article; zbMATH DE number 5263405 (Why is no real title available?)
- Algorithms – ESA 2005
- A general lower bound for collaborative tree exploration
- Time versus cost tradeoffs for deterministic rendezvous in networks
- Efficient live exploration of a dynamic ring with mobile robots
- Exploring a Dynamic Ring Without Landmark
- Exploration of High-Dimensional Grids by Finite State Machines
- Tight bounds for deterministic high-dimensional grid exploration
- Graph exploration by a deterministic memoryless automaton with pebbles
- Derandomizing random walks in undirected graphs using locally fair exploration strategies
- Learning to act and observe in partially observable domains
- 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
- Exploration of graphs with excluded minors
- Exploring wedges of an oriented grid by an automaton with pebbles
- Optimal graph exploration without good maps
- An improved lower bound for competitive graph exploration
- How to hunt an invisible rabbit on a graph
- The beachcombers' problem: walking and searching with mobile robots
- How many ants does it take to find the food?
- 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 an unknown graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4718736)
