Edge Exploration of a Graph by Mobile Agent

Amit Kumar Dhar, Barun Gorain, Kaushik Mondal, Shaswati Patra, Rishi Ranjan Singh

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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 unlabeled, and the ports at a node of degree d are arbitrarily numbered. A mobile agent, starting from some 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 information, called advice, is provided to the agent a priori. Following the paradigm of algorithms with advice, this priori information is provided to the agent by an Oracle in the form of a binary string. The Oracle knows the graph, but does not have the knowledge of the starting point of the agent. In this paper, we consider the following two problems of edge exploration. The first problem is: “how fast is it possible to explore an n node graph regardless of the size of advice provided to the agent?” We show a lower bound ofon exploration time to answer the above question. Next, we show the existence of an time algorithm with advice. The second problem then asks the following question: “what is the smallest advice that needs to be provided to the agent in order to achieve time?” We show a lower bound on size of the advice, for any, to answer the above question.

Original languageEnglish
Title of host publicationCombinatorial Optimization and Applications - 13th International Conference, COCOA 2019, Proceedings
EditorsYingshu Li, Mihaela Cardei, Yan Huang
PublisherSpringer
Pages142-154
Number of pages13
ISBN (Print)9783030364113
DOIs
StatePublished - 1 Jan 2019
Externally publishedYes
Event13th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2019 - Xiamen, China
Duration: 13 Dec 201915 Dec 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11949 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference13th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2019
Country/TerritoryChina
CityXiamen
Period13/12/1915/12/19

Keywords

  • Advice
  • Algorithm
  • Exploration
  • Graph
  • Mobile agent

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Edge Exploration of a Graph by Mobile Agent'. Together they form a unique fingerprint.

Cite this