Impact of topographic information on graph exploration efficiency

DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0037(200009)36:2<96::AID-NET4>3.0.CO;2-N" /><96::AID-NET4>3.0.CO;2-N 10.1002/1097-0037(200009)36:2<96::AID-NET4>3.0.CO;2-NzbMath1145.68599OpenAlexW2071941627MaRDI QIDQ4519131

Petrişor Panaite, Andrzej Pelc

Publication date: 3 December 2000

Full work available at URL: https://doi.org/10.1002/1097-0037(200009)36:2<96::aid-net4>3.0.co;2-n

zbMATH Keywords

algorithmgraphknowledgeexplorationtraversal

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Artificial intelligence for robotics (68T40)

Related Items (5)

Memory Efficient Anonymous Graph Exploration ⋮ On the Power of Local Orientations ⋮ Tree exploration with advice ⋮ Optimal graph exploration without good maps ⋮ Anonymous graph exploration without collision by mobile robots

Cites Work

• Shortest paths without a map
• Perfect broadcasting in unlabeled networks
• Broadcasting in unlabeled hypercubes with a linear number of messages.
• Exploring Unknown Undirected Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Impact of topographic information on graph exploration efficiency