Tree exploration with little memory
From MaRDI portal
Recommendations
Cited in
(48)- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Searching for a black hole in arbitrary networks: optimal mobile agents protocols
- Exploring sparse graphs with advice
- A tight lower bound for semi-synchronous collaborative grid exploration
- Building a nest by an automaton
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Map construction of unknown graphs by multiple agents
- Graph exploration by a finite automaton
- Efficient grid exploration with a stationary token
- Tree exploration with logarithmic memory
- Exploration of Faulty Hamiltonian Graphs
- Tree exploration with logarithmic memory
- Lower and upper competitive bounds for online directed graph exploration
- 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
- Deterministic network exploration by a single agent with Byzantine tokens
- scientific article; zbMATH DE number 2119714 (Why is no real title available?)
- LABEL-GUIDED GRAPH EXPLORATION WITH ADJUSTABLE RATIO OF LABELS
- Building a nest by an automaton
- A tight lower bound for semi-synchronous collaborative grid exploration
- Memory Efficient Anonymous Graph Exploration
- STACS 2004
- Structural Information and Communication Complexity
- Tree Exploration with an Oracle
- Connected reconfiguration of lattice-based cellular structures by finite-memory robots
- A general lower bound for collaborative tree exploration
- A nearly optimal randomized algorithm for explorable heap selection
- 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
- IMPLEMENTATION OF GRAPH THEORY AND APPLICATION BY MAXIMA SOFTWARE
- Edge exploration of anonymous graph by mobile agent with external help
- Tight bounds for deterministic high-dimensional grid exploration
- Graph exploration by a deterministic memoryless automaton with pebbles
- Exploration of convex terrains by a deterministic automaton with pebbles
- Collision-free exploration by mobile agents using pebbles
- Exploring wedges of an oriented grid by an automaton with pebbles
- A nearly optimal randomized algorithm for explorable heap selection
- Collaborative exploration of trees by energy-constrained mobile robots
- Memory optimal dispersion by anonymous 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
- Weighted nearest neighbor algorithms for the graph exploration problem on cycles
This page was built for publication: Tree exploration with little memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4818671)
