A Study on the Problems of Dispersion and Exploration on Graph Topology

Document Type

Conference Article

Publication Title

ACM International Conference Proceeding Series

Abstract

In this paper we discuss two important problems: Dispersion and Exploration. We have provided two optimal algorithms for each of them. For Dispersion we have provided an algorithm which is optimal in terms of memory complexity and for Exploration we have given an algorithm which is optimal in terms of number of robots in a dynamic ring. We give a brief idea about our algorithms and novelty of our techniques.

First Page

244

Last Page

245

DOI

10.1145/3491003.3491302

Publication Date

1-4-2022

This document is currently not available here.

Share

COinS