Exploring sparse graphs with advice
type: Item
instance of: scholarly article
title: Exploring sparse graphs with advice
author: Hans-Joachim Böckenhauer
author: Janosch Fuchs
author: Walter Unger
published in: Information and Computation
publication date: 2022-12-08T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7629143
zbMATH Keywords: graph exploration
zbMATH Keywords: advice complexity
zbMATH Keywords: fixed-graph scenario
MaRDI profile type: Publication
full work available at URL: j.ic.2022.104950
OpenAlex ID: W4292845823
cites work: Exploring sparse graphs with advice (extended abstract)
cites work: Navigating in Unfamiliar Geometric Terrain
cites work: Constructing competitive tours from local information
cites work: An improved lower bound for competitive graph exploration
cites work: Online graph exploration: New results on old and new algorithms
cites work: Exploring Unknown Environments
cites work: Algorithms – ESA 2005
cites work: Lower and upper competitive bounds for online directed graph exploration
cites work: Tree exploration with little memory
cites work: STACS 2004
cites work: Network Exploration by Silent and Oblivious Robots
cites work: Map construction of unknown graphs by multiple agents
cites work: The power of a pebble: Exploring and mapping directed graphs
cites work: How Much Information about the Future Is Needed?
cites work: Information Complexity of Online Problems
cites work: On the Advice Complexity of Online Problems
cites work: Online computation with advice
cites work: Tree exploration with advice
cites work: Online Graph Exploration with Advice
cites work: Treasure Hunt with Advice
cites work: Deterministic Graph Exploration with Advice
DOI: 10.1016/J.IC.2022.104950
description: scientific article; zbMATH DE number 7629143