Tree exploration with advice

DOI10.1016/j.ic.2008.07.005zbMath1169.68047MaRDI QIDQ958304

Andrzej Pelc, David Ilcinkas, Pierre Fraigniaud

Publication date: 3 December 2008

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2008.07.005

zbMATH Keywords

exploration algorithm

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

Drawing maps with advice, Fast radio broadcasting with advice, Communication algorithms with advice, Black Hole Search in Directed Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Local MST computation with short advice
• Optimal graph exploration without good maps
• Shortest paths without a map
• Piecemeal graph exploration by a mobile robot.
• The power of a pebble: Exploring and mapping directed graphs
• Sense of direction in distributed computing
• Optimal deterministic broadcasting in known topology radio networks
• How to learn an unknown environment. I
• Online Navigation in a Room
• Navigating in Unfamiliar Geometric Terrain
• Tree exploration with little memory
• Exploring Unknown Undirected Graphs
• Exploring Unknown Environments
• Hundreds of impossibility results for distributed computing
• Faster communication in known topology radio networks
• Oracle size
• Graph Searching with Advice
• Distributed Computing with Advice: Information Sensitivity of Graph Coloring
• Algorithms – ESA 2005
• Broadcasting algorithms in radio networks with unknown topology