The power of local computations in graphs with initial knowledge

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1764, Issue , 2000, Pages 71-84

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

^a UNIVERSITÉ BORDEAUX 1   (France)

^b UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIONAL KNOWLEDGE; GRAPH PROPERTIES; GRAPH TOPOLOGY; LOCAL COMPUTATION; LOCAL COMPUTATIONS IN GRAPHS; PLANARITY;

GRAPH THEORY;

EID: 84949974308     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-46464-8_6     Document Type: Conference Paper

References (17)

1. 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. H.-L. Bodlaender and J. Van Leeuwen. Simulation of large networks on smaller networks. Information and Control, 71:143–180, 1986.
3. A. Bottreau and Y. Métivier. Minor searching, normal forms of graph relabelling: two applications based on enumerations by graph relabelling. In Foundations of Software Science and Computation Structures (FoSSaCS’98), volume 1378 of Lecture notes in computer science, pages 110–124. Springer-Verlag, 1998.
4. J. E. Burns and J. Pachl. Uniform self-stabilizing rings. ACM Trans. Program. Lang. Syst., 11:330–344, 1989.
5. B. Courcelle and Y. Métivier. Coverings and minors: application to local computations in graphs. Europ. J. Combinatorics, 15:127–138, 1994.
6. H. De Fraysseix, J. Pach, and R. Pollack. Small sets supporting Fáry embeddings of planar graphs. In Proc. of the 20th Ann. ACM Symp. Theory of Computing, Chicago, 1988, pages 426–433. ACM Press, 1988.
7. M. J. Fisher, N. A. Lynch, and M. Merritt. Easy impossibility proofs for distributed consensus problems. Distrib. Comput., 1:26–29, 1986.
8. I. Litovsky, Y. Métivier, and E. Sopena. Different local controls for graph relabelling systems. Math. Syst. Theory, 28:41–65, 1995.
9. 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.
10. W. S. Massey. A basic course in algebraic topology. Springer-Verlag, 1991. Graduate texts in mathematics.
11. A. Mazurkiewicz. Trace theory. In W. Brauer et al., eds., Petri nets, applications and relationship to other models of concurrency, volume 255 of Lecture notes in computer science, pages 279–324. Spinger-Verlag, 1987.
12. A. Mazurkiewicz. Distributed enumeration. Inf. Processing Letters, 61:233–239, 1997.
13. Yves Métivier, Anca Muscholl, and Pierre-André Wacrenier. About the local detection of termination of local computations in graphs. In D. Krizanc and P. Widmayer, editors, Proceedings of the 4th International Colloquium on Structural Information and Communication Complexity (SIROCCO’97), Ascona, Switzerland, number 1 in Proceedings in Informatics, pages 188–200, Canada, 1997. Carleton Scientific.
14. Yves Métivier and Pierre-André Wacrenier. A distributed algorithm for computing a spanning tree in anonymous T-prime graphs. Submitted, 1998.
15. K. Reidemeister. Einführung in die kombinatorische Topologie. Vieweg, Brunswick, 1932.
16. 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.
17. 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.