Efficient graph exploration

DOI10.14279/DEPOSITONCE-8714MaRDI QIDQ6631296zbMATH OpenFDO

Authors Jan Hackfeld

Publication date 1 November 2024

Full work available at URL https://doi.org/10.14279/DEPOSITONCE-8714

zbMATH Keywords

approximation algorithmscompetitive analysiscomplexity theorygraph explorationonline algorithm

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Planar graphs; geometric and topological aspects of graph theory (05C10) Signed and weighted graphs (05C22) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Recommendations

• Tight bounds for undirected graph exploration with pebbles and multiple agents
• Fast collaborative graph exploration
• Fast collaborative graph exploration
• scientific article; zbMATH DE number 6862102
• Collaborative exploration of trees by energy-constrained mobile robots

This page was built for publication: Efficient graph exploration

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