Parallel Graph Theory Algorithms on Tree Mesh Structure

In this paper,we present some parallel algorithms for graph problem on the treemesh structure with n×n leaf-nodes,including a n-order matrix multiplication algorithm in timeO（nlogn）,an algorithm of finding all-pairs shortest-path of n-vertex digraph in time O（nlogn）,anda bridge-finding algorithm of n-vertex undirected graph in time O（log³n）.