
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Masafumi Yamashita, Tsunehiko Kameda, "Computing on Anonymous Networks: Part IIDecision and Membership Problems," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 1, pp. 9096, January, 1996.  
BibTex  x  
@article{ 10.1109/71.481600, author = {Masafumi Yamashita and Tsunehiko Kameda}, title = {Computing on Anonymous Networks: Part IIDecision and Membership Problems}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {7}, number = {1}, issn = {10459219}, year = {1996}, pages = {9096}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.481600}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Computing on Anonymous Networks: Part IIDecision and Membership Problems IS  1 SN  10459219 SP90 EP96 EPD  9096 A1  Masafumi Yamashita, A1  Tsunehiko Kameda, PY  1996 KW  Anonymous network KW  computability KW  distributed computing KW  leader election KW  edge election KW  spanning tree construction KW  topology recognition KW  NPcompleteness. VL  7 JA  IEEE Transactions on Parallel and Distributed Systems ER   
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 Ptime to NPcomplete or coNPcomplete.
[1] A.V. Aho,J.E. Hopcroft, and J.D. Ullman,The Design and Analysis of Computer Algorithms.Reading, Mass.: AddisonWesley, 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 NPCompleteness.New York: W.H. Freeman, 1979.
[4] A.F. Harary,Graph Theory.Reading, Mass.: AddisonWesley, 1969.
[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. 1727,Syracuse, N.Y., 1980.
[6] J. Petersen,"Die Theorie der regulären Graphs," Acta Mathematica, vol. 15, pp. 193220, 1891.
[7] M. Yamashita and T. Kameda, “Computing on Anonymous Networks,” Proc. Seventh ACM Symp. Principles Distributed Computing, Toronto, pp. 117–131, 1988.
[8] M. Yamashita and T. Kameda, “Computing on Anonymous Networks, Part I: Characterizing the Solvable Cases,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 1, pp. 69–89, Jan. 1996.