This Article 
 Bibliographic References 
 Add to: 
Editorial Board Changes
January 1996 (vol. 7 no. 1)
pp. 1-2

[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,"Local and global 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.San Francisco, Calif.: W.H. Freeman and Company, 1979.
[4] A.F. Harary,Graph Theory.Reading, Mass.: Addison-Wesley, 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. 17-27,Syracuse, N.Y., 1980.
[6] J. Petersen,"Die Theorie der regulären Graphs," Acta Mathematica, vol. 15, pp. 193-220, 1891.
[7] M. Yamashita and T. Kameda,"Computing on anonymous networks," Proc. Seventh ACM Symp. Principles of Distributed Computing, pp. 117-131,Toronto, Ontario, Canada, 1988.
[8] M. Yamashita and T. Kameda,"Computing on anonymous networks, Part I: Characterizing the solvable cases," IEEE Trans. Parallel and Distributed Computing Systems, this issue.

"Editorial Board Changes," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 1, pp. 1-2, Jan. 1996, doi:10.1109/TPDS.1996.10000
Usage of this product signifies your acceptance of the Terms of Use.