Tree Exploration with an Oracle

DOI10.1007/11821069_2MaRDI QIDQ5756703zbMATH OpenOpenAlexFDO

Authors Pierre Fraigniaud, David Ilcinkas, 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

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

Recommendations

• Tree exploration with logarithmic memory
• Tree exploration with logarithmic memory
• scientific article; zbMATH DE number 2119714
• Tree exploration with little memory
• Possibilistic search trees
• On decision trees for orthants
• Collective tree exploration
• LATIN 2004: Theoretical Informatics
• Efficient exploration of faulty trees
• An efficient method of examining all trees

Cited in

(12)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756703)