2 papers
cs.DC2025
Can Like Attract Like? A Study of Homonymous Gathering in Networks
Stéphane Devismes, Yoann Dieudonné, Arnaud Labourel
A team of mobile agents, starting from distinct nodes of a network, have to meet at the same node and declare that they all met. Agents execute the same algorithm, which they start…
cs.DS2024
Graph Exploration: The Impact of a Distance Constraint
Stéphane Devismes, Yoann Dieudonné, Arnaud Labourel
A mobile agent, starting from a node of a simple undirected connected graph , has to explore all nodes and edges of using the minimum number of edge traversals. To…