SOFSEM 2006: Theory and Practice of Computer Science

DOI10.1007/11611257zbMath1175.68033OpenAlexW2756057450MaRDI QIDQ5897990

Evangelos Kranakis, Danny Krizanc, Leszek Gąsieniec, Xiaohui Zhang

Publication date: 14 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11611257

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings, Uniform multi-agent deployment on a ring, Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty, Partial gathering of mobile agents in asynchronous unidirectional rings, Move-optimal gossiping among mobile agents, Deterministic symmetric rendezvous with tokens in a synchronous torus, Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring, Mobile Agent Rendezvous in a Ring Using Faulty Tokens