TY - GEN
T1 - Agent-Driven BFS Tree in Anonymous Graphs with Applications
AU - Chand, Prabhat Kumar
AU - Kumar, Manish
AU - Molla, Anisur Rahaman
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.
PY - 2024/1/1
Y1 - 2024/1/1
N2 - Breadth-First-Search (BFS) trees serve a pivotal role in designing efficient graph algorithms due to their efficacy in traversing and exploring graph structures with a systematic layer-by-layer approach. This paper introduces an agent-based novel approach for constructing a BFS tree on an arbitrary anonymous graph G with n nodes and m edges using k≥n autonomous mobile agents. In this paper, we provide algorithms for BFS tree construction for different starting configurations and demonstrate their applications. Our main result considers the dispersed starting configuration (i.e., each node is occupied by a single agent at the start) and takes O(DΔ) rounds to execute, where D is the diameter and Δ is the highest degree of G. The algorithm assumes the knowledge of a root node for the BFS tree. We further continue our investigation for BFS tree construction with two other classical configurations, namely, rooted configuration and arbitrary configuration (with and without the knowledge of root) of the agents with some other follow-up configurations for k>n. In addition, the paper demonstrates the application of the BFS tree construction methodology in tasks like - checking a graph for bipartiteness and gathering agents into a single node, a fundamental task in distributed robotics.
AB - Breadth-First-Search (BFS) trees serve a pivotal role in designing efficient graph algorithms due to their efficacy in traversing and exploring graph structures with a systematic layer-by-layer approach. This paper introduces an agent-based novel approach for constructing a BFS tree on an arbitrary anonymous graph G with n nodes and m edges using k≥n autonomous mobile agents. In this paper, we provide algorithms for BFS tree construction for different starting configurations and demonstrate their applications. Our main result considers the dispersed starting configuration (i.e., each node is occupied by a single agent at the start) and takes O(DΔ) rounds to execute, where D is the diameter and Δ is the highest degree of G. The algorithm assumes the knowledge of a root node for the BFS tree. We further continue our investigation for BFS tree construction with two other classical configurations, namely, rooted configuration and arbitrary configuration (with and without the knowledge of root) of the agents with some other follow-up configurations for k>n. In addition, the paper demonstrates the application of the BFS tree construction methodology in tasks like - checking a graph for bipartiteness and gathering agents into a single node, a fundamental task in distributed robotics.
KW - Bipartite Graph
KW - Breadth First Search Tree
KW - Distributed Graph Algorithms
KW - Distributed Network Algorithms
KW - Gathering
KW - Memory Complexity
KW - Mobile Agents
KW - Time Complexity
UR - https://www.scopus.com/pages/publications/85202599282
U2 - 10.1007/978-3-031-67321-4_4
DO - 10.1007/978-3-031-67321-4_4
M3 - Conference contribution
AN - SCOPUS:85202599282
SN - 9783031673207
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 67
EP - 82
BT - Networked Systems - 12th International Conference, NETYS 2024, Proceedings
A2 - Castañeda, Armando
A2 - Enea, Constantin
A2 - Gupta, Nirupam
PB - Springer Science and Business Media Deutschland GmbH
T2 - 12th International Conference on Networked Systems, NETYS 2024
Y2 - 29 May 2024 through 31 May 2024
ER -