Energy constrained depth first search

DOI10.1007/S00453-024-01275-8MaRDI QIDQ6647777

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

Publication date: 3 December 2024

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

distributed algorithmgraph explorationonline explorationDFS traversalpiecemeal exploration

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Convergecast and broadcast by power-aware mobile agents
• Collaborative exploration of trees by energy-constrained mobile robots
• Piecemeal graph exploration by a mobile robot.
• Online graph exploration: New results on old and new algorithms
• Online graph exploration algorithms for cycles and trees by multiple searchers
• Collaborative delivery with energy-constrained mobile robots
• Fast collaborative graph exploration
• Communication Problems for Mobile Agents Exchanging Energy
• Online Graph Exploration with Advice
• Optimal constrained graph exploration
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Tree exploration with logarithmic memory
• Collective tree exploration
• Undirected Graph Exploration with ⊝(log log n) Pebbles
• Exploring Unknown Undirected Graphs
• Why Robots Need Maps
• A Recursive Approach to Multi-robot Exploration of Trees
• Smart Robot Teams Exploring Sparse Trees
• A general lower bound for collaborative tree exploration

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)