Easy impossibility proofs for distributed consensus problems
Distributed Computing
On the recognition of families of graphs with local computations
Information and Computation
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
Computing on Anonymous Networks: Part II-Decision and Membership Problems
IEEE Transactions on Parallel and Distributed Systems
Graph relabelling systems and distributed algorithms
Handbook of graph grammars and computing by graph transformation
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Local Computations in Graphs: The Case of Cellular Edge Local Computations
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Romanian Academy Calea Victoriei 125, Bucharest, Romania Locally Derivable Graphs
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Local computations on closed unlabelled edges: the election problem and the naming problem
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Fundamenta Informaticae - Understanding Computers' Intelligence Celebrating the 100th Volume of Fundamenta Informaticae in Honour of Helena Rasiowa
| Hi-index | 0.01 |
The paper deals with the class of finite triangular graphs. It turns out that this class enjoys regular properties similar to those of trees and complete graphs. The main objective of the paper is to lift algorithms for some typical local computations, known for other classes of graphs, to the class of triangular graphs. Local algorithms on graphs, according to [8, 9], are defined as local rules for relabeling graph nodes. Rules are local, if they are defined only for a class of subgraphs of processed graph (as neighborhoods of nodes or edges) and neither their results nor their applicability do not depend upon the knowledge of the whole graph labeling. While designing local algorithm for triangular graphs one needs to use some intrinsic properties of such graphs; it puts some additional light on their inherent structure. To illustrate essential features of local computations on triangular graphs, local algorithms for three typical issues of local computations are discussed: leader election, spanning tree construction, and nodes ordering. Correctness of these algorithms, as deadlock freeness, proper termination, and impartiality, are proved.