A further study on weak Byzantine gathering of mobile agents

The gathering of mobile agents in the presence of Byzantine faults is first studied by Dieudonné et al. Authors provide a polynomial time algorithm handling any number of weak Byzantine agents in the presence of at least one good agent considering start-up delays, i.e., the good agents may not wake...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 1022; p. 114892
Main Authors:	Saxena, Ashish, Mondal, Kaushik
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 29.12.2024
Subjects:	Anonymous graphs Byzantine faults Deterministic algorithm Gathering Mobile agents Byzantine faults Gathering Deterministic algorithm Anonymous graphs Mobile agents
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!