Publication 1996 Issue No. 1 - January Abstract - Computing on Anonymous Networks: Part II-Decision and Membership Problems
Computing on Anonymous Networks: Part II-Decision and Membership Problems
January 1996 (vol. 7 no. 1)
pp. 90-96
 ASCII Text x Masafumi Yamashita, Tsunehiko Kameda, "Computing on Anonymous Networks: Part II-Decision and Membership Problems," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 1, pp. 90-96, January, 1996.
 BibTex x @article{ 10.1109/71.481600,author = {Masafumi Yamashita and Tsunehiko Kameda},title = {Computing on Anonymous Networks: Part II-Decision and Membership Problems},journal ={IEEE Transactions on Parallel and Distributed Systems},volume = {7},number = {1},issn = {1045-9219},year = {1996},pages = {90-96},doi = {http://doi.ieeecomputersociety.org/10.1109/71.481600},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on Parallel and Distributed SystemsTI - Computing on Anonymous Networks: Part II-Decision and Membership ProblemsIS - 1SN - 1045-9219SP90EP96EPD - 90-96A1 - Masafumi Yamashita, A1 - Tsunehiko Kameda, PY - 1996KW - Anonymous networkKW - computabilityKW - distributed computingKW - leader electionKW - edge electionKW - spanning tree constructionKW - topology recognitionKW - NP-completeness.VL - 7JA - IEEE Transactions on Parallel and Distributed SystemsER -

Abstract—In anonymous networks, the processors do not have identity numbers. In Part I of this paper, we characterized the classes of networks on which some representative distributed computation problems are solvable under different conditions. A new graph property called symmetricity played a central role in our analysis of anonymous networks. In Part II, we turn our attention to the computational complexity issues. We first discuss the complexity of determining the symmetricity of a given graph, and then that of testing membership in each of the 16 classes of anonymous networks defined in Part I. It turns out that, depending on the class, the complexity varies from P-time to NP-complete or co-NP-complete.

[1] A.V. Aho,J.E. Hopcroft, and J.D. Ullman,The Design and Analysis of Computer Algorithms.Reading, Mass.: Addison-Wesley, 1974.
[2] D. Angluin, “Global and Local Properties in Networks of Processors,” Proc. 12th ACM Symp. Theory of Computing, pp. 82–93, 1980.
[3] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[5] S. Micali and V.V. Vazirani,"An$O\!\left( {\sqrt {\left| V \right|}\times \left| E \right|} \right)$algorithm for finding maximum matching in general graphs," Proc. 21st IEEE Symp. Foundations of Computer Science, pp. 17-27,Syracuse, N.Y., 1980.