We study parallel algorithms for a number of graph problems, using the Single Instruction Stream-Multiple Data Stream model.

In this paper, a sequential algorithm computing the all vertex pair distance matrixD and the path matrixP is given. On a PRAM EREW model withp,1≤p.

Using the radix sort and known results for parallel prefix on linked lists, we develop parallel algorithms that efficiently solve various computations on trees ...

In this paper, a sequential algorithm computing the all vertex pair distance matrix D and the path matrix Pis given. On a PRAM EREW model with p ,l~<p~<n 2 ...

We study parallel algorithms for a number of graph problems, using the Single Instruction Stream-Multiple. Data Stream model. We assume that the processors.

Parallel algorithms of time complexity O ( log 2 ⁡ n ) are described for finding biconnected components, bridges, minimum spanning trees and fundamental cycles.

In this paper,a sequential algorithm computing the all vertex pair distance matrix D and the path matrix Pis given.On a PRAM EREW model with p,1≤p≤n~2 ...

摘要: In this paper,a sequential algorithm computing the all vertex pair distance matrix D and the path matrix Pis given.On a PRAM EREW model with p,1≤p≤n~2 ...

A general time bound is derived for a parallel algorithm that uses K processors for finding the connected components of an undirected graph and the result ...

This document gives new parallel algorithms for integer sorting and undirected graph connectivity problems such as connected components and spanning forest.