Echo Algorithms: Depth Parallel Operations on General Graphs

IEEE Transactions on Software Engineering

Volumn SE-8, Issue 4, 1982, Pages 391-401

  Chang, Ernest J H ^a  

^a UNIVERSITY OF VICTORIA   (Canada)

Author keywords

Computer networks; decentralized control; distributed computing; graph algorithms

Indexed keywords

COMPUTER PROGRAMMING;

EID: 0020151814     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSE.1982.235573     Document Type: Article

References (9)

1. A. V. Aho, J. E. Hopcioft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1974.
2. R. Arjomandi and D. G. Cornell, “Parallel computations in graph theory,” SIAM J. Compute vol. 7, May 1978.
3. E.J.H. Chang and R. Roberts, “An improved algorithm for decentralized extrema finding in circular configurations of processes,” Commun. Ass. Comput. Mach., vol. 22, May 1979.
4. E.J.H. Chang, “Decentralized algorithms in distributed systems,” Ph.D. dissertation, Univ. Toronto, Toronto, Ont, Canada, 1979.
5. E.J.H. Chang and K. Sevcik, “Decentralized algorithms for the multiple-copy update problem,” Univ. Victoria, Victoria, B.C., Canada, Tech. Rep. 1979.
6. D. M. Eckstein and D. A. Alton, “Parallel graph processing using depth-first search,” in Proc. Conf. Theoretical Comput. Sci., Univ. Waterloo, Waterloo, Ont., Canada, Aug. 1977.
7. C. A. Ellis, “A robust algorithm for updating duplicate databases,” in Proc. 2nd Berkeley Workshop on Distributed Data Management and Computer Networks, Univ. California, Berkeley, May 1977.
8. P. Rosenstiehl et al., “Intelligent graphs: Networks of finite automata capable of solving graph problems,” in Graph Theory and Computing, R. Read, Ed. New York: Academic, 1972.
9. R. E. Tarjan, “Depth first search and linear graph algorithms,” SIAMJ. Comput., vol. 1, no. 2, 1972.