Exploring sparse graphs with advice (extended abstract)
From MaRDI portal
Publication:1757761
DOI10.1007/978-3-030-04693-4_7OpenAlexW2903188967MaRDI QIDQ1757761
Hans-Joachim Böckenhauer, Janosch Fuchs, Walter Unger
Publication date: 15 January 2019
Full work available at URL: https://doi.org/10.1007/978-3-030-04693-4_7
Related Items (5)
An improved lower bound for competitive graph exploration ⋮ Online graph exploration on a restricted graph class: optimal solutions for tadpole graphs ⋮ The secretary problem with reservation costs ⋮ Advice complexity of treasure hunt in geometric terrains ⋮ Exploring sparse graphs with advice
This page was built for publication: Exploring sparse graphs with advice (extended abstract)