Exploring sparse graphs with advice
From MaRDI portal
Publication:2105435
DOI10.1016/j.ic.2022.104950OpenAlexW4292845823MaRDI QIDQ2105435
Janosch Fuchs, Walter Unger, Hans-Joachim Böckenhauer
Publication date: 8 December 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2022.104950
Cites Work
- Lower and upper competitive bounds for online directed graph exploration
- Online computation with advice
- An improved lower bound for competitive graph exploration
- Tree exploration with advice
- Exploring sparse graphs with advice (extended abstract)
- The power of a pebble: Exploring and mapping directed graphs
- Online graph exploration: New results on old and new algorithms
- Map construction of unknown graphs by multiple agents
- Online Graph Exploration with Advice
- Network Exploration by Silent and Oblivious Robots
- Treasure Hunt with Advice
- Information Complexity of Online Problems
- On the Advice Complexity of Online Problems
- Navigating in Unfamiliar Geometric Terrain
- Constructing competitive tours from local information
- Tree exploration with little memory
- Exploring Unknown Environments
- Deterministic Graph Exploration with Advice
- STACS 2004
- How Much Information about the Future Is Needed?
- Algorithms – ESA 2005
This page was built for publication: Exploring sparse graphs with advice
