Energy constrained depth first search

DOI10.1007/S00453-024-01275-8MaRDI QIDQ6647777zbMATH OpenFDO

Authors Shantanu Das, Dariusz Dereniowski, Przemysław Uznański

Publication date 3 December 2024

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00453-024-01275-8

zbMATH Keywords

DFS traversaldistributed algorithmgraph explorationonline explorationpiecemeal exploration

Mathematics Subject Classification ID

Graph theory (05Cxx) Algorithms in computer science (68Wxx)

Cites work

• A general lower bound for collaborative tree exploration
• A recursive approach to multi-robot exploration of trees
• Brief announcement: Energy constrained depth first search
• Collaborative exploration of trees by energy-constrained mobile robots
• Collective tree exploration
• Communication problems for mobile agents exchanging energy
• Convergecast and broadcast by power-aware mobile agents
• Exploring Unknown Undirected Graphs
• Fast collaborative graph exploration
• Online graph exploration algorithms for cycles and trees by multiple searchers
• Online graph exploration with advice
• Online graph exploration: New results on old and new algorithms
• Optimal constrained graph exploration
• Piecemeal graph exploration by a mobile robot.
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Smart Robot Teams Exploring Sparse Trees
• Tree exploration with logarithmic memory
• Undirected Graph Exploration with ⊝(log log n) Pebbles
• Why Robots Need Maps

This page was built for publication: Energy constrained depth first search

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