Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases

Abstract

In anonymous networks, the processors do not have identity numbers. We investigate the following representative problems on anonymous networks: (a) the leader election problem, (b) the edge election problem, (c) the spanning tree construction problem, and (d) the topology recognition problem. On a given network, the above problems may or may not be solvable… (More)
DOI: 10.1109/71.481599

Topics

8 Figures and Tables

Cite this paper

@article{Yamashita1996ComputingOA, title={Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases}, author={Masafumi Yamashita and Tsunehiko Kameda}, journal={IEEE Trans. Parallel Distrib. Syst.}, year={1996}, volume={7}, pages={69-89} }