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....

Celý popis

Podrobná bibliografia

Vydané v:	Information and computation Ročník 307; s. 105380
Hlavní autori:	Das, Sajal K., Dhar, Amit Kumar, Gorain, Barun, Mahawar, Madhuri
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.11.2025
Predmet:	Anonymous graph Deterministic algorithm Exploration Mobile agent Anonymous graph Exploration Mobile agent Deterministic algorithm
ISSN:	0890-5401
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!