Results 1  10
of
139,763
Efficient parallel algorithms for chordal graphs
"... We give the first efficient parallel algorithms for recognizing chordal graphs, finding a maximum clique and a maximum independent set in a chordal graph, finding an optimal coloring of a chordal graph, finding a breadthfirst search tree and a depthfirst search tree of a chordal graph, recognizing ..."
Abstract

Cited by 27 (0 self)
 Add to MetaCart
We give the first efficient parallel algorithms for recognizing chordal graphs, finding a maximum clique and a maximum independent set in a chordal graph, finding an optimal coloring of a chordal graph, finding a breadthfirst search tree and a depthfirst search tree of a chordal graph
EFFICIENT PARALLEL ALGORITHMS ON THE NETWORK MODEL
, 1990
"... We develop efficient parallel algorithms for several fundamental problems on the hypercube, the shuffleexchange, the cubeconnected cycles and the butterfly. Those problems are related to load balancing, packet routing, list ranking, graph theory and VLSI routing.Load balancing, sorting and packet ..."
Abstract
 Add to MetaCart
We develop efficient parallel algorithms for several fundamental problems on the hypercube, the shuffleexchange, the cubeconnected cycles and the butterfly. Those problems are related to load balancing, packet routing, list ranking, graph theory and VLSI routing.Load balancing, sorting
An Efficient Parallel Algorithm for Mesh Smoothing
 INTERNATIONAL MESHING ROUNDTABLE
, 1995
"... Automatic mesh generation and adaptive refinement methods have proven to be very successful tools for the efficient solution of complex finite element applications. A problem with these methods is that they can produce poorly shaped elements; such elements are undesirable because they introduce ..."
Abstract

Cited by 54 (10 self)
 Add to MetaCart
numerical difficulties in the solution process. However, the shape of the elements can be improved through the determination of new geometric locations for mesh vertices by using a mesh smoothing algorithm. In this paper we present a new parallel algorithm for mesh smoothing that has a fast parallel
Efficient Parallel Algorithms for Tree Accumulations
 Science of Computer Programming
, 1994
"... Accumulations are higherorder operations on structured objects; they leave the shape of an object unchanged, but replace elements of that object with accumulated information about other elements. Upwards and downwards accumulations on trees are two such operations; they form the basis of many tree ..."
Abstract

Cited by 19 (7 self)
 Add to MetaCart
algorithms. We present two Erew Pram algorithms for computing accumulations on trees taking O(log n) time on O(n= log n) processors, which is optimal.
Efficient parallel algorithms for mining associations
 PARALLEL AND DISTRIBUTED SYSTEMS
, 2000
"... ..."
An Efficient Parallel Algorithm for MatrixVector Multiplication
 International Journal of High Speed Computing
, 1995
"... . The multiplication of a vector by a matrix is the kernel operation in many algorithms used in scientific computation. A fast and efficient parallel algorithm for this calculation is therefore desirable. This paper describes a parallel matrixvector multiplication algorithm which is particularly ..."
Abstract

Cited by 41 (4 self)
 Add to MetaCart
. The multiplication of a vector by a matrix is the kernel operation in many algorithms used in scientific computation. A fast and efficient parallel algorithm for this calculation is therefore desirable. This paper describes a parallel matrixvector multiplication algorithm which is particularly
An Efficient Parallel Algorithm to Solve Block–Toeplitz Systems
"... Abstract. In this paper, we present an efficient parallel algorithm to solve Toeplitz–block and block–Toeplitz systems in distributed memory multicomputers. This algorithm parallelizes the Generalized Schur Algorithm to obtain the seminormal equations. Our parallel implementation reduces the commun ..."
Abstract
 Add to MetaCart
Abstract. In this paper, we present an efficient parallel algorithm to solve Toeplitz–block and block–Toeplitz systems in distributed memory multicomputers. This algorithm parallelizes the Generalized Schur Algorithm to obtain the seminormal equations. Our parallel implementation reduces
Results 1  10
of
139,763