The Power and the Limitations of Local Computations on Graphs

Authors:
Igor Litovsky;Yves Métivier;Wieslaw Zielonka
Affiliations:
-;-;-
Venue:
WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science
Year:
1992

Universal Semi-local Election Protocol Using Forward Links

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Distributed and randomized enumeration

EURO-PDP'00 Proceedings of the 8th Euromicro conference on Parallel and distributed processing
Locally constrained graph homomorphisms-structure, complexity, and applications

Computer Science Review
Universal Semi-local Election Protocol Using Forward Links

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
EXPANDING GRAPH RELABELING SYSTEMS HAVE THE POWER OF RECURSIVE ENUMERABILITY

Fundamenta Informaticae

Hi-index	0.00