论文信息 - Echo Algorithms: Depth Parallel Operations on General Graphs

Echo Algorithms: Depth Parallel Operations on General Graphs

This paper describes a method for the detection of properties of general graphs in an environment in which each node can be considered an autonomous processor, interacting with its neighbors by passing messages.

Ernest J. H. Chang | E. Chang

[1] P. Rosenstiehl,et al. INTELLIGENT GRAPHS: NETWORKS OF FINITE AUTOMATA CAPABLE OF SOLVING GRAPH PROBLEMS , 1972 .

[2] Denise Marie Eckstein. Parallel graph processing using depth-first search and breadth-first search. , 1977 .

[3] Ernest Jen-Hao Chang. Decentralized algorithms in distributed systems , 1979 .

[4] Ernest J. H. Chang,et al. An improved algorithm for decentralized extrema-finding in circular configurations of processes , 1979, CACM.

[5] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[6] Clarence A. Ellis,et al. A Robust Algorithm for Updating Duplicate Databases , 1977, Berkeley Workshop.

[7] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[8] Derek G. Corneil,et al. Parallel computations in graph theory , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).