Deterministic network exploration by a single agent with Byzantine tokens
type: Item
instance of: scholarly article
title: Deterministic network exploration by a single agent with Byzantine tokens
zbMATH Open document ID: 1243.68022
author: Yoann Dieudonné
author: Andrzej Pelc
published in: Information Processing Letters
publication date: 2012-07-25T00:00:00Z
Mathematics Subject Classification ID: 68M07
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 6059688
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: deterministic algorithm
zbMATH Keywords: exploration
zbMATH Keywords: mobile agent
zbMATH Keywords: network
MaRDI profile type: Publication
full work available at URL: j.ipl.2012.03.017
OpenAlex ID: W2044918117
cites work: Exploring Unknown Environments
cites work: Tree exploration with logarithmic memory
cites work: Piecemeal graph exploration by a mobile robot.
cites work: Q4542545
cites work: Mobile Agent Rendezvous in a Ring Using Faulty Tokens
cites work: Map construction of unknown graphs by multiple agents
cites work: Exploring an unknown graph
cites work: Optimal graph exploration without good maps
cites work: Tree exploration with little memory
cites work: Optimal constrained graph exploration
cites work: Algorithms – ESA 2005
cites work: Structural Information and Communication Complexity
cites work: LATIN 2004: Theoretical Informatics
cites work: Collective tree exploration
cites work: Universal traversal sequences with backtracking.
cites work: Undirected connectivity in log-space
cites work: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
cites work: Q2934643
DOI: 10.1016/J.IPL.2012.03.017
description: scientific article; zbMATH DE number 6059688