Deterministic Graph Exploration with Advice

DOI10.4230/LIPICS.ICALP.2017.132zbMATH Open1442.68170OpenAlexW2963137958MaRDI QIDQ5111464FDOQ5111464

Authors: Barun Gorain, Andrzej Pelc 

Publication date: 27 May 2020

Full work available at URL: https://doi.org/10.4230/LIPIcs.ICALP.2017.132

Recommendations

• Deterministic graph exploration with advice
• Online graph exploration with advice
• Graph searching with advice
• Graph Searching with Advice
• Algorithms – ESA 2005
• Exploring sparse graphs with advice
• Stochastic graph exploration
• Optimal constrained graph exploration
• Optimal constrained graph exploration
• Optimal graph exploration without good maps

zbMATH Keywords

algorithmadvicemobile agentgraph exploration

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Cited In (14)

• Edge exploration of anonymous graph by mobile agent with external help
• Exploring sparse graphs with advice
• Topology recognition with advice
• Drawing maps with advice
• Graph Searching with Advice
• Tree exploration with advice
• Deterministic size discovery and topology recognition in radio networks with short labels
• Exploring sparse graphs with advice (extended abstract)
• Deterministic graph exploration with advice
• Online graph exploration with advice
• Advice complexity of treasure hunt in geometric terrains
• Drawing maps with advice
• Edge exploration of a graph by mobile agent
• Explorable families of graphs

This page was built for publication: Deterministic Graph Exploration with Advice

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