Journal ArticleDOI
Distributed enumeration
Reads0
Chats0
TLDR
It is proved that for any graph there exists a computation terminating with any a priori given enumeration of its nodes, and it is also proved that after successful termination individual nodes "know" this fact.About:
This article is published in Information Processing Letters.The article was published on 1997-03-14. It has received 76 citations till now. The article focuses on the topics: Enumeration.read more
Citations
More filters
Journal ArticleDOI
Drawing maps with advice
Dariusz Dereniowski,Andrzej Pelc +1 more
TL;DR: The problem of the amount of information required to draw a complete or a partial map of a graph with unlabeled nodes and arbitrarily labeled ports is studied and bounds on the minimum size of advice are given.
Book ChapterDOI
Rendezvous of mobile agents in unknown graphs with faulty links
TL;DR: The model is a generalization of the case where all the dangerous channels lead to single node, called the Black Hole, where knowledge of only a "tight" bound on the network size is sufficient for solving the problem, whenever it is solvable.
Journal ArticleDOI
Locality and checkability in wait-free computing
TL;DR: This paper studies notions of locality that are inherent to the specification of distributed tasks by identifying fundamental relationships between the various scales of computation by defining a correspondence between subgroups of the edgepath group of an input complex and locality-preserving tasks.
Journal ArticleDOI
Characterizations of Classes of Graphs Recognizable by Local Computations
TL;DR: This paper investigates the power of local computations on graphs, by considering a classical problem in distributed algorithms, the recognition problem, and characterize the graph classes that are recognizable with or without structural knowledge.
Deterministic Algorithms in Dynamic Networks: Problems, Analysis, and Algorithmic Tools
Arnaud Casteigts,Paola Flocchini +1 more
TL;DR: Recent efforts towards the design and analysis of distributed algorithms in dynamic networks are reviewed, with an emphasis on those results that are of a deterministic and analytical nature.
References
More filters
Journal ArticleDOI
Solution of a problem in concurrent programming control
TL;DR: A number of mainly independent sequential-cyclic processes with restricted means of communication with each other can be made in such a way that at any moment one and only one of them is engaged in the “critical section” of its cycle.
Book
Solution of a problem in concurrent programming control
TL;DR: A number of mainly independent sequential-cyclic processes with restricted means of communication with each other can be made in such a way that at any moment one and only one of them is engaged in the "critical section" of its cycle.
Journal ArticleDOI
Coverings and Minors
Bruno Courcelle,Yves Métivier +1 more
TL;DR: Using the notion of covering, it is proved that a minor-closed class of graphs cannot be recognized by local computations, except in a few special cases.
Journal ArticleDOI
Solvability of the asynchronous ranking problem
TL;DR: Il s'agit de trouver un etat initial and un protocole identique pour tous les proceseurs constituant l'anneau, de maniere a ce that tous the processeurs puissent eventuellement atteindre leurs etats finaux.