Deterministic Graph Exploration with Advice

DOI10.4230/LIPICS.ICALP.2017.132MaRDI QIDQ5111464zbMATH OpenOpenAlexFDO

Authors 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)

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

Cited in

(14)

• Topology recognition with advice
• Exploring sparse graphs with advice
• Edge exploration of anonymous graph by mobile agent with external help
• Drawing maps with advice
• Graph Searching with Advice
• Tree exploration with advice
• Exploring sparse graphs with advice (extended abstract)
• Deterministic size discovery and topology recognition in radio networks with short labels
• 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)