Optimal constrained graph exploration

DOI10.1145/1159892.1159897zbMath1321.68382OpenAlexW2149735608MaRDI QIDQ2944522

Stephen G. Kobourov, Christian A. Duncan, V. S. Anil Kumar

Publication date: 2 September 2015

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1159892.1159897

zbMATH Keywords

computational learning theorygraph exploration

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)

Related Items (22)

Memory optimal dispersion by anonymous mobile robots ⋮ Memory Efficient Anonymous Graph Exploration ⋮ Online graph exploration: New results on old and new algorithms ⋮ Grid exploration by a swarm of autonomous robots with minimum repetitions ⋮ Efficient live exploration of a dynamic ring with mobile robots ⋮ Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs ⋮ Impact of knowledge on the cost of treasure hunt in trees ⋮ Graph covering using bounded size subgraphs ⋮ Unnamed Item ⋮ Exploration of Faulty Hamiltonian Graphs ⋮ A tight lower bound for semi-synchronous collaborative grid exploration ⋮ Building a nest by an automaton ⋮ Memory optimal dispersion by anonymous mobile robots ⋮ Online Graph Exploration: New Results on Old and New Algorithms ⋮ Online graph exploration algorithms for cycles and trees by multiple searchers ⋮ Unnamed Item ⋮ A general lower bound for collaborative tree exploration ⋮ Time versus cost tradeoffs for deterministic rendezvous in networks ⋮ Near-gathering of energy-constrained mobile agents ⋮ More Efficient Periodic Traversal in Anonymous Undirected Graphs ⋮ A tight lower bound for semi-synchronous collaborative grid exploration ⋮ Fast collaborative graph exploration

This page was built for publication: Optimal constrained graph exploration