Optimal constrained graph exploration
From MaRDI portal
Publication:2944522
DOI10.1145/1159892.1159897zbMath1321.68382MaRDI 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
68T05: Learning and adaptive systems in artificial intelligence
68R10: Graph theory (including graph drawing) in computer science
68T40: Artificial intelligence for robotics
Related Items
Unnamed Item, Unnamed Item, A tight lower bound for semi-synchronous collaborative grid exploration, Memory Efficient Anonymous Graph Exploration, A general lower bound for collaborative tree exploration, Time versus cost tradeoffs for deterministic rendezvous in networks, Near-gathering of energy-constrained mobile agents, Memory optimal dispersion by anonymous mobile robots, 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, Memory optimal dispersion by anonymous mobile robots, Online graph exploration: New results on old and new algorithms, A tight lower bound for semi-synchronous collaborative grid exploration, Building a nest by an automaton, Online graph exploration algorithms for cycles and trees by multiple searchers, Fast collaborative graph exploration, Grid exploration by a swarm of autonomous robots with minimum repetitions, Exploration of Faulty Hamiltonian Graphs, Online Graph Exploration: New Results on Old and New Algorithms, More Efficient Periodic Traversal in Anonymous Undirected Graphs
