TY - JOUR
T1 - Edge exploration of anonymous graph by mobile agent with external help
AU - Dhar, Amit Kumar
AU - Gorain, Barun
AU - Mondal, Kaushik
AU - Patra, Shaswati
AU - Singh, Rishi Ranjan
N1 - Funding Information:
Barun Gorain and Kaushik Mondal acknowledge the support of the Science and Engineering Research Board (SERB), Department of Science and Technology, Govt. of India (Grant Number: CRG/2020/005964). Amit K. Dhar, Barun Gorain, and Rishi Ranjan Singh acknowledges the support of the Research Initiation Grant supported by IIT Bhilai, India. Barun Gorain also acknowledges partial support of SERB (Grant Number: MTR/2021/000118). Kaushik Mondal also acknowledges the support of FIST program, supported by Department of Science and Technology, Govt. of India (SR/FST/MS-I/2018/22(C)).
Funding Information:
Barun Gorain and Kaushik Mondal acknowledge the support of the Science and Engineering Research Board (SERB), Department of Science and Technology, Govt. of India (Grant Number: CRG/2020/005964). Amit K. Dhar, Barun Gorain, and Rishi Ranjan Singh acknowledges the support of the Research Initiation Grant supported by IIT Bhilai, India. Barun Gorain also acknowledges partial support of SERB (Grant Number: MTR/2021/000118). Kaushik Mondal also acknowledges the support of FIST program, supported by Department of Science and Technology, Govt. of India (SR/FST/MS-I/2018/22(C)).
Publisher Copyright:
© 2022, The Author(s), under exclusive licence to Springer-Verlag GmbH Austria, part of Springer Nature.
PY - 2023/2/1
Y1 - 2023/2/1
N2 - Exploration of an unknown network by one or multiple mobile entities is a well studied problem which has various applications like treasure hunt, collecting data from some node in the network or samples from contaminated mines. In this paper, we study the problem of edge exploration of an n node graph by a mobile agent. The nodes of the graph are anonymous, and the edges at a node of degree d are arbitrarily assigned unique port numbers in the range 0 , 1 , ⋯ , d- 1. A mobile agent, starting from a node, has to visit all the edges of the graph and stop. The time of the exploration is the number of edges the agent traverses before it stops. The task of exploration can not be performed even for a class of cycles if no additional help is provided. We consider two different ways of providing additional help to the agent by an Oracle. In the first scenario, the nodes of the graph are provided some short labels by the Oracle. In the second scenario, some additional information, called advice, is provided to the agent in the form of a binary string. For the first scenario, we show that exploration can be done by providing constant size labels to the nodes of the graph. For the second scenario, we show that exploration can not be completed within time o(n83) regardless of the advice provided to the agent. We propose an upper bound result by designing an O(n3) algorithm with O(nlog n) advice. We also show a lower bound Ω(n83) on the size of advice to perform exploration in O(n3) time. In addition, we have done experimental studies on randomly created anonymous graph to analyze time complexity of exploration with O(nlog n) size advice.
AB - Exploration of an unknown network by one or multiple mobile entities is a well studied problem which has various applications like treasure hunt, collecting data from some node in the network or samples from contaminated mines. In this paper, we study the problem of edge exploration of an n node graph by a mobile agent. The nodes of the graph are anonymous, and the edges at a node of degree d are arbitrarily assigned unique port numbers in the range 0 , 1 , ⋯ , d- 1. A mobile agent, starting from a node, has to visit all the edges of the graph and stop. The time of the exploration is the number of edges the agent traverses before it stops. The task of exploration can not be performed even for a class of cycles if no additional help is provided. We consider two different ways of providing additional help to the agent by an Oracle. In the first scenario, the nodes of the graph are provided some short labels by the Oracle. In the second scenario, some additional information, called advice, is provided to the agent in the form of a binary string. For the first scenario, we show that exploration can be done by providing constant size labels to the nodes of the graph. For the second scenario, we show that exploration can not be completed within time o(n83) regardless of the advice provided to the agent. We propose an upper bound result by designing an O(n3) algorithm with O(nlog n) advice. We also show a lower bound Ω(n83) on the size of advice to perform exploration in O(n3) time. In addition, we have done experimental studies on randomly created anonymous graph to analyze time complexity of exploration with O(nlog n) size advice.
KW - Advice
KW - Algorithm
KW - Anonymous graph
KW - Exploration
KW - Labeling
KW - Mobile agent
UR - http://www.scopus.com/inward/record.url?scp=85142922413&partnerID=8YFLogxK
U2 - 10.1007/s00607-022-01136-8
DO - 10.1007/s00607-022-01136-8
M3 - Article
AN - SCOPUS:85142922413
SN - 0010-485X
VL - 105
SP - 483
EP - 506
JO - Computing (Vienna/New York)
JF - Computing (Vienna/New York)
IS - 2
ER -