The power and the limitations of local computations on graphs-Reference-Cited by-同舟云学术

The power and the limitations of local computations on graphs

Published:1993 Issue: Volume: Page:333-345
ISSN:0302-9743
Container-title:Graph-Theoretic Concepts in Computer Science
language:
Short-container-title:

Author:

Litovsky Igor,Métivier Yves,Zielonka Wiesław

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-56402-0_58.pdf

Reference18 articles.

1. D.Angluin: Local and global properties in networks of processors. in Proceedings of the 12th STOC (1980) 82–93

2. D.Angluin and A.Gardiner: Finite common coverings of pairs of regular graphs. J. Combin. Theory Ser. B 30 (1981) 184–187

3. O.Baudon: Cabri-graphes, un cahier de brouillon interactif pour la théorie des graphes. Ph.D. Université Joseph Fourier, Grenoble I (1990)

4. C.Berge: Graphes et Hypergraphes. Dunod, Paris (1970)

5. J.Berstel: Résolution, par un réseau d'automates, du problème des arborescences dans un graphe. C.R. Acad. Sc. Paris, Série A, t.264 (1967) 388–390

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract);Graph-Theoretic Concepts in Computer Science;2023

2. Self-organized aggregation without computation;The International Journal of Robotics Research;2014-04-16

3. Computational Complexity of Covering Three-Vertex Multigraphs;Mathematical Foundations of Computer Science 2014;2014

4. Enumeration protocol in Estelle: an exercise in stepwise development;IFIP Advances in Information and Communication Technology;1998

5. Locally computable enumerations;Fundamentals of Computation Theory;1997