Characterizations of Classes of Graphs Recognizable by Local Computations

Theory of Computing Systems

Volumn 37, Issue 2, 2004, Pages 249-293

  Godard, Emmanuel ^a   Métivier, Yves ^b   Muscholl, Anca ^c  

^a AIX MARSEILLE UNIV   (France)

^b UNIVERSITÉ BORDEAUX 1   (France)

^c UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SIMULATION; GRAPH THEORY; MATHEMATICAL INSTRUMENTS; PROBLEM SOLVING; SET THEORY;

CLASSES; DISTRIBUTED ALGORITHMS;

COMPUTATION THEORY;

EID: 1642586158     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-003-1062-1     Document Type: Article

References (34)

1. [A] D. Angluin. Local and global properties in networks of processors. In Proceedings of the 12th Symposium on Theory of Computing, pages 82-93, 1980.
2. [B] A. Bottreau. Réécritures de graphe et calculs distribués. Ph.D. thesis, Université Bordeaux I. 1997.
3. [BL] H.-L. Bodlaender and J. Van Leeuwen. Simulation of large networks on smaller networks. Information and Control, 71:143-180, 1986.
4. [BV] P. Boldi and S. Vigna. Computing anonymously with arbitrary knowledge, In Proceedings of the 18th ACM Symposium on Principles of Distributed Computing, pages 181-188. ACM Press, New York, 1999.
5. [CM] B. Courcelle and Y. Métivier. Coverings and minors: applications to local computations in graphs. European Journal of Combinatorics, 15:127-138, 1994.
6. [DFPP] H. De Fraysseix, J. Pach, and R. Pollack. Small sets supporting Fáry embeddings of planar graphs. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago, 1988, pages 426-433. ACM Press, New York, 1988.
7. [DZ] F. Demichelis and W. Zielonka. Decidability questions for graph k-coverings. Technical Report, LaBRI, 1996.
8. [F] M. R. Fellows. The Robertson-Seymour theorems: a survey of applications. Contemporary Mathematics, 89:1-18, 1989.
9. [FLM] M. J. Fisher, N. A. Lynch, and M. Merritt. Easy impossibility proofs for distributed consensus problems. Distributed Computing, 1:26-29, 1986.
10. [G] E. Godard. Réécritures de Graphes et Algorithmique Distribuée. Ph.D. thesis, Université Bordeaux I, 2002.
11. [GMI] E. Godard and Y. Métivier. Characterization of classes of graphs recognizable by local computations with initial knowledge (extended abstract). In SIROCCO 01-8th International Colloquium on Structural Information & Communication Complexity, number 11 in Proceedings in Informatics, pages 179-194. Carleton Scientific, Ottawa, 2001.
12. [GM2] E. Godard and Y. Métivier. A characterization of families of graphs in which election is possible (extended abstract). In M. Nielsen and U. Engberg, editors, Proceedings of Foundations of Software Science and Computation Structures, FOSSACS '02, number 2303 in LNCS, pages 159-171. Springer-Verlag, Berlin, 2002.
13. [GM3] E. Godard and Y. Métivier. Equivalence of structural knowledges in distributed algorithms. In SIROCCO 02-9th International Colloquium on Structural Information & Communication Complexity, number 13 in Proceedings in Informatics, pages 149-164. Carleton Scientific, Ottawa, 2002.
14. [GMM] E. Godard, Y. Métivier, and A. Muscholl. The power of local computations in graphs with initial knowledge. In Proceedings of Theory and Applications of Graph Transformations '98, number 1764 in LNCS, pages 71-84. Springer, Berlin, 2000.
15. [GMT] E. Godard, Y. Métivier, and G. Tel. Election, termination and graph cartography. In preparation.
16. [L] F. T. Leighton. Finite common coverings of graphs. Journal of Combinatorial Theory, Series B, 33:231-238, 1982.
17. [LMS1] I. Litovsky, Y. Métivier, and E. Sopena. Checking global graph properties by means of local computations: the majority problem. Electronic Notes in Theoretical Computer Science, 2, 1995.
18. [LMS2] I. Litovsky, Y. Métivier, and E. Sopena. Graph relabelling systems and distributed algorithms. In H. Ehrig, H.J. Kreowski, U. Montanari, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, volume 3, pages 1-56. World Scientific, Singapore, 1999.
19. [LMZ] I. Litovsky, Y. Métivier, and W. Zielonka. On the recognition of families of graphs with local computations. Information and Computation, 118(1):110-119, 1995.
20. [M1] W. S. Massey. A Basic Course in Algebraic Topology. Springer-Verlag, New York, 1991.
21. [M2] A. Mazurkiewicz. Trace theory. In W. Brauer et al., editor, Petri Nets, Applications and Relationship to Other Models of Concurrency, volume 255 of LNCS, pages 279-324. Springer-Verlag, Berlin, 1987.
22. [M3] A. Mazurkiewicz. Distributed enumeration. Information Processing Letters, 61:233-239, 1997.
23. [MMW] Y. Métivier, A. Muscholl, and P.-A. Wacrenier. About the local detection of termination of local computations in graphs. In D. Krizanc and P. Widmayer, editors, SIROCCO 97-4th International Colloquium on Structural Information & Communication Complexity, Proceedings in Informatics, pages 188-200. Carleton Scientific, Ottawa, 1997.
24. [MT] Y. Métivier and G. Tel. Termination detection and universal graph reconstruction. In SIROCCO 00-7th International Colloquium on Structural Information & Communication Complexity, pages 237-251, 2000.
25. [NS] M. Naor and L. Stockmeyer. What can be computed locally? SIAM Journal on Computing, 24(6):1259-1277, 1995.
26. [R1] K. Reidemeister. Einführung in die Kombinatorische Topologie. Vieweg, Brunswick, 1932.
27. [R2] K. H. Rosen, editor. Handbook of Discrete and Combinatorial Mathematics. CRC Press, Boca Raton, FL, 2000.
28. [RFH] P. Rosenstiehl, J.-R. Fiksel, and A. Holliger. Intelligent graphs. In R. Read, editor, Graph Theory and Computing, pages 219-265. Academic Press, New York, 1972.
29. [RS] N. Robertson and P. Seymour. Graph minors, VII: disjoint paths on a surface. Journal of Combinatorial Theory, Series B, 45:212-254, 1988.
30. [T] G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, Cambridge, 2000.
31. [vL] Jan van Leeuwen, editor. Handbook of Theoretical Computer Science, volumes A and B. Elsevier Science, Amsterdam, 1990.
32. [YK1] M. Yamashita and T. Kameda. Computing on anonymous networks: Part I - characterizing the solvable cases. IEEE Transactions on Parallel and Distributed Systems, 7(1):69-89, 1996.
33. [YK2] M. Yamashita and T. Kameda. Computing on anonymous networks: Part II - decision and membership problems. IEEE Transactions on Parallel and Distributed Systems, 7(1):90-96, 1996.
34. [YK3] M. Yamashita and T. Kameda. Leader election problem on networks in which processor identity numbers are not distinct. IEEE Transactions on Parallel and Distributed Systems, 10(9):878-887, 1999.