Collision-free exploration by mobile agents using pebbles

In this paper, we study collision-free graph exploration in an anonymous network. The network is modeled as a graph G=(V,E) where the nodes of the graph are unlabeled, and each edge incident to a node v has a unique label, called the port number, in {0,1,⋯,d−1}, where d is the degree of the node v....

Full description

Bibliographic Details

Published in:	Information and computation Vol. 307; p. 105380
Main Authors:	Das, Sajal K., Dhar, Amit Kumar, Gorain, Barun, Mahawar, Madhuri
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.11.2025
Subjects:	Anonymous graph Deterministic algorithm Exploration Mobile agent Anonymous graph Exploration Mobile agent Deterministic algorithm
ISSN:	0890-5401
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!