Theory of Computing Systems

, Volume 37, Issue 2, pp 249–293 | Cite as

Characterizations of Classes of Graphs Recognizable by Local Computations



This paper investigates the power of local computations on graphs, by considering a classical problem in distributed algorithms, the recognition problem. Formally, we want to compute some topological information on a network of processes, possibly using additional knowledge about the structure of the underlying graph. We propose the notion of recognition with structural knowledge by means of local computations. Then we characterize the graph classes that are recognizable with or without structural knowledge. The characterizations use graph coverings and a distributed enumeration algorithm proposed by A. Mazurkiewicz. Several applications are presented, in particular concerning minor-closed classes of graphs.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 2004

Authors and Affiliations

  1. 1.LIF, Université de Provence, 39 rue Joliot-Curie, 13453 Marseille cedex 13France
  2. 2.LaBRI, Université Bordeaux I, ENSEIRB, 351 cours de la Libération, 33405 TalenceFrance
  3. 3.LIAFA, Université Paris VII, 2 place Jussieu, case 7014, 75251 Paris cedex 05France

Personalised recommendations