A modular technique for the design of efficient distributed leader finding algorithms
ACM Transactions on Programming Languages and Systems (TOPLAS)
Exploring unknown environments
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The power of a pebble: exploring and mapping directed graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Comparison of initial conditions for distributed algorithms on anonymous networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Exploring unknown undirected graphs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Assigning labels in an unknown anonymous network with a leader
Distributed Computing
Agent Rendezvous: A Dynamic Symmetry-Breaking Problem
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Optimal Graph Exploration without Good Maps
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Can we elect if we cannot compare?
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Mobile Agent Rendezvous in a Ring
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Tree exploration with little memory
Journal of Algorithms
Journal of Graph Theory
The power of team exploration: two robots can learn unlabeled directed graphs
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Map construction of unknown graphs by multiple agents
Theoretical Computer Science
Note: Setting port numbers for fast graph exploration
Theoretical Computer Science
r3: Resilient Random Regular Graphs
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Fault-tolerant simulation of message-passing algorithms by mobile agents
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Mobile agent algorithms versus message passing algorithms
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Distributed security algorithms by mobile agents
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Improved distributed exploration of anonymous networks
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Setting port numbers for fast graph exploration
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Election in the qualitative world
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Effective elections for anonymous mobile agents
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Hi-index | 0.00 |
We consider a group of identical asynchronous agents, initially located at different nodes of an undirected simple graph. The nodes of the graph are unlabeled, and each contains a whiteboard where the visiting agents can write to and read from. The agents, initially, do not know the graph nor its topology. The only a-priori knowledge the agents may have is either the number n of nodes, or the total number k of agents. The goal is for the agents to construct a labelled map of the unknown graph, the same for all agents, so to be in complete agreement with each-other about their environment. This problem, called Labelled Map Construction, is closely related to a variety of other basic problems, including election and rendezvous. We are interested in efficient and generic protocols that can solve the problem, irrespective of the graph topology, where the cost of the algorithm is measured in terms of the total number of moves (or, edge traversals) made by the agents. We present a novel deterministic algorithm that, provided that n and k are co-prime (a necessary condition), constructs a map of the graph, elects a leader among the agents, and provides a unique labelling on the nodes of the graph. Our algorithm uses no more than O(km) edge traversals where m is the number of edges in the graph. Our result improves on the finding by Barriere et al. [4] for graphs with sense of direction, extending it to graphs with arbitrary labelling, provided that one of n or k is known.