Deterministic Graph Exploration with Advice

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

Barun Gorain, Andrzej Pelc

Publication date: 27 May 2020

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

zbMATH Keywords

algorithmadvicemobile agentgraph exploration

Mathematics Subject Classification ID

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

Cited In (5)

• Edge exploration of anonymous graph by mobile agent with external help
• Exploring sparse graphs with advice
• Graph Searching with Advice
• Deterministic size discovery and topology recognition in radio networks with short labels
• Advice complexity of treasure hunt in geometric terrains

   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 👍 👎

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)