scientific article
From MaRDI portal
Publication:2768385
zbMath0992.68160MaRDI QIDQ2768385
Christian A. Duncan, Stephen G. Kobourov, V. S. Anil Kumar
Publication date: 11 September 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)
Related Items (16)
Fault-tolerant sequential scan ⋮ Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots ⋮ Collaborative Exploration by Energy-Constrained Mobile Robots ⋮ Computing without communicating: ring exploration by asynchronous oblivious robots ⋮ Deterministic network exploration by a single agent with Byzantine tokens ⋮ Fast periodic graph exploration with constant memory ⋮ Setting port numbers for fast graph exploration ⋮ Collaborative delivery on a fixed path with homogeneous energy-constrained agents ⋮ Impact of memory size on graph exploration capability ⋮ Tree exploration with advice ⋮ Remembering without memory: tree exploration by asynchronous oblivious robots ⋮ Optimal graph exploration without good maps ⋮ Collaborative exploration of trees by energy-constrained mobile robots ⋮ Collaborative delivery with energy-constrained mobile robots ⋮ Collective tree exploration ⋮ Graph exploration by a finite automaton
This page was built for publication:
