TY - GEN
T1 - Mobile Agents on Chordal Graphs
T2 - 21st International Conference on Distributed Computing and Intelligent Technology, ICDCIT 2025
AU - Kaur, Tanvir
AU - Paul, Kaustav
AU - Mondal, Kaushik
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.
PY - 2025/1/1
Y1 - 2025/1/1
N2 - We consider the problem of finding a maximum independent set (MaxIS) of chordal graphs using mobile agents. Suppose n agents are initially placed arbitrarily on the nodes of an n-node chordal graph G=(V,E). Agents need to find a maximum independent set M of G such that each node of M is occupied by at least one agent. Also, each of the n agents must know whether its occupied node is a part of M or not. Starting from both rooted and arbitrary initial configuration, we provide distributed algorithms for n mobile agents having O(logn) memory each to compute the MaxIS of G in O(mnlogΔ) time, where m denotes the number of edges in G and Δ is the maximum degree of the graph. Agents do not need prior knowledge of any parameters if the initial configuration is rooted. For arbitrary initial configuration, agents need to know few global parameters beforehand. We further show that using a similar approach it is possible to find the maximum clique in chordal graphs and color any chordal graph with the minimum number of colors. We also provide a dynamic programming-based approach to solve the MaxIS finding problem in trees in O(n) time.
AB - We consider the problem of finding a maximum independent set (MaxIS) of chordal graphs using mobile agents. Suppose n agents are initially placed arbitrarily on the nodes of an n-node chordal graph G=(V,E). Agents need to find a maximum independent set M of G such that each node of M is occupied by at least one agent. Also, each of the n agents must know whether its occupied node is a part of M or not. Starting from both rooted and arbitrary initial configuration, we provide distributed algorithms for n mobile agents having O(logn) memory each to compute the MaxIS of G in O(mnlogΔ) time, where m denotes the number of edges in G and Δ is the maximum degree of the graph. Agents do not need prior knowledge of any parameters if the initial configuration is rooted. For arbitrary initial configuration, agents need to know few global parameters beforehand. We further show that using a similar approach it is possible to find the maximum clique in chordal graphs and color any chordal graph with the minimum number of colors. We also provide a dynamic programming-based approach to solve the MaxIS finding problem in trees in O(n) time.
KW - Deterministic algorithms
KW - Distributed algorithms
KW - Maximum Independent Set
KW - Mobile agents
UR - https://www.scopus.com/pages/publications/85215682757
U2 - 10.1007/978-3-031-81404-4_8
DO - 10.1007/978-3-031-81404-4_8
M3 - Conference contribution
AN - SCOPUS:85215682757
SN - 9783031814037
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 92
EP - 107
BT - Distributed Computing and Intelligent Technology - 21st International Conference, ICDCIT 2025, Proceedings
A2 - Bramas, Quentin
A2 - Chatterjee, Bapi
A2 - Devismes, Stéphane
A2 - Egan, Malcolm
A2 - Mandal, Partha Sarathi
A2 - Mukhopadhyaya, Krishnendu
A2 - Saradhi, V. Vijaya
PB - Springer Science and Business Media Deutschland GmbH
Y2 - 8 January 2025 through 11 January 2025
ER -