Tree Exploration with an Oracle

DOI10.1007/11821069_2zbMath1132.68507OpenAlexW1501234213MaRDI QIDQ5756703

David Ilcinkas, Pierre Fraigniaud, Andrzej Pelc

Publication date: 5 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11821069_2

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (9)

Proof labeling schemes ⋮ Distributed computing with advice: information sensitivity of graph coloring ⋮ Measuring the problem-relevant information in input ⋮ Local MST computation with short advice ⋮ Fast Radio Broadcasting with Advice ⋮ Local Maps: New Insights into Mobile Agent Algorithms ⋮ Online computation with advice ⋮ Trade-offs between the size of advice and broadcasting time in trees ⋮ Graph searching with advice

This page was built for publication: Tree Exploration with an Oracle