Tree exploration with little memory

DOI10.1016/J.JALGOR.2003.10.002MaRDI QIDQ4818671zbMATH OpenOpenAlexFDO

Authors Krzysztof Diks, Pierre Fraigniaud, Andrzej Pelc, Evangelos Kranakis

Publication date 1 October 2004

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jalgor.2003.10.002

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Artificial intelligence for robotics (68T40)

Recommendations

• scientific article; zbMATH DE number 2119714
• Tree exploration with logarithmic memory
• Tree exploration with logarithmic memory
• Graph exploration by a finite automaton
• Mathematical Foundations of Computer Science 2004

Cited in

(44)

• Graph covering using bounded size subgraphs
• Exploring sparse graphs with advice
• Memory optimal dispersion by anonymous mobile robots
• Edge exploration of anonymous graph by mobile agent with external help
• A general lower bound for collaborative tree exploration
• A tight lower bound for semi-synchronous collaborative grid exploration
• scientific article; zbMATH DE number 2119714 (Why is no real title available?)
• Memory optimal dispersion by anonymous mobile robots
• Weighted nearest neighbor algorithms for the graph exploration problem on cycles
• IMPLEMENTATION OF GRAPH THEORY AND APPLICATION BY MAXIMA SOFTWARE
• A tight lower bound for semi-synchronous collaborative grid exploration
• Building a nest by an automaton
• Map construction of unknown graphs by multiple agents
• Computing without communicating: ring exploration by asynchronous oblivious robots
• Tree Exploration with an Oracle
• Tree exploration with advice
• Graph exploration by a deterministic memoryless automaton with pebbles
• Invited paper: One bit agent memory is enough for snap-stabilizing perpetual exploration of cactus graphs with distinguishable cycles
• Deterministic network exploration by a single agent with Byzantine tokens
• Efficient grid exploration with a stationary token
• Collaborative exploration of trees by energy-constrained mobile robots
• Tree exploration with logarithmic memory
• Searching for a black hole in arbitrary networks: optimal mobile agents protocols
• OPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENT
• Memory Efficient Anonymous Graph Exploration
• How to meet when you forget: log-space rendezvous in arbitrary graphs
• Fast periodic graph exploration with constant memory
• LABEL-GUIDED GRAPH EXPLORATION WITH ADJUSTABLE RATIO OF LABELS
• Connected reconfiguration of lattice-based cellular structures by finite-memory robots
• Exploration of Faulty Hamiltonian Graphs
• How many ants does it take to find the food?
• Exploring an unknown dangerous graph with a constant number of tokens
• Structural Information and Communication Complexity
• Lower and upper competitive bounds for online directed graph exploration
• A nearly optimal randomized algorithm for explorable heap selection
• Graph exploration by a finite automaton
• STACS 2004
• Setting port numbers for fast graph exploration
• Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
• Tight bounds for deterministic high-dimensional grid exploration
• Collaborative Exploration by Energy-Constrained Mobile Robots
• Tree exploration with logarithmic memory
• scientific article; zbMATH DE number 7525472 (Why is no real title available?)
• Impact of memory size on graph exploration capability

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)