Tree exploration with little memory

From MaRDI portal
Publication:4818671

DOI10.1016/j.jalgor.2003.10.002zbMath1067.68100OpenAlexW2017617294MaRDI QIDQ4818671

Andrzej Pelc, Krzysztof Diks, Pierre Fraigniaud, 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




Related Items (35)

Memory optimal dispersion by anonymous mobile robotsOPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENTMemory Efficient Anonymous Graph ExplorationCollaborative Exploration by Energy-Constrained Mobile RobotsLower and upper competitive bounds for online directed graph explorationComputing without communicating: ring exploration by asynchronous oblivious robotsEFFICIENT GRID EXPLORATION WITH A STATIONARY TOKENA nearly optimal randomized algorithm for explorable heap selectionHow many ants does it take to find the food?How to meet when you forget: log-space rendezvous in arbitrary graphsExploring an unknown dangerous graph with a constant number of tokensGraph covering using bounded size subgraphsInvited paper: One bit agent memory is enough for snap-stabilizing perpetual exploration of cactus graphs with distinguishable cyclesIMPLEMENTATION OF GRAPH THEORY AND APPLICATION BY MAXIMA SOFTWAREExploration of Faulty Hamiltonian GraphsDeterministic network exploration by a single agent with Byzantine tokensSearching for a black hole in arbitrary networks: optimal mobile agents protocolsA tight lower bound for semi-synchronous collaborative grid explorationBuilding a nest by an automatonFast periodic graph exploration with constant memoryMap construction of unknown graphs by multiple agentsSetting port numbers for fast graph explorationMemory optimal dispersion by anonymous mobile robotsLABEL-GUIDED GRAPH EXPLORATION WITH ADJUSTABLE RATIO OF LABELSImpact of memory size on graph exploration capabilityTree exploration with adviceUnnamed ItemWeighted nearest neighbor algorithms for the graph exploration problem on cyclesCollaborative exploration of trees by energy-constrained mobile robotsA general lower bound for collaborative tree explorationSelf-stabilizing robots in highly dynamic environmentsConnected reconfiguration of lattice-based cellular structures by finite-memory robotsA tight lower bound for semi-synchronous collaborative grid explorationGraph exploration by a finite automatonExploring sparse graphs with advice




This page was built for publication: Tree exploration with little memory