Deterministic network exploration by a single agent with Byzantine tokens

DOI10.1016/j.ipl.2012.03.017zbMath1243.68022OpenAlexW2044918117MaRDI QIDQ436569

Yoann Dieudonné, Andrzej Pelc

Publication date: 25 July 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.03.017

zbMATH Keywords

networkanalysis of algorithmsdeterministic algorithmmobile agentexploration

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07)

Related Items (4)

Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots ⋮ Rendezvous in networks in spite of delay faults ⋮ EFFICIENT GRID EXPLORATION WITH A STATIONARY TOKEN ⋮ Exploration of Faulty Hamiltonian Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal graph exploration without good maps
• Piecemeal graph exploration by a mobile robot.
• Universal traversal sequences with backtracking.
• Map construction of unknown graphs by multiple agents
• Tree exploration with logarithmic memory
• Collective tree exploration
• Undirected connectivity in log-space
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Exploring an unknown graph
• Tree exploration with little memory
• Exploring Unknown Environments
• Structural Information and Communication Complexity
• Mobile Agent Rendezvous in a Ring Using Faulty Tokens
• Algorithms – ESA 2005
• LATIN 2004: Theoretical Informatics

This page was built for publication: Deterministic network exploration by a single agent with Byzantine tokens