Optimal Systolic Design for the Transitive Closure and the Shortest Path Problems
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
Parallel computation: models and methods
Parallel computation: models and methods
Time-efficient parallel algorithms for the longest common subsequence and related problems
Journal of Parallel and Distributed Computing
Graph Problems on a Mesh-Connected Processor Array
Journal of the ACM (JACM)
Introduction to Algorithms: A Creative Approach
Introduction to Algorithms: A Creative Approach
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Optimal BSR Solutions to Several Convex Polygon Problems
The Journal of Supercomputing
IEEE Transactions on Parallel and Distributed Systems
An Optimal Implementation of Broadcasting with Selective Reduction
IEEE Transactions on Parallel and Distributed Systems
Graph Theory With Applications
Graph Theory With Applications
| Hi-index | 0.02 |
This paper presents BSR-parallel algorithms for some problems in fundamental graph theory : transitive closure, connected components, spanning tree, bridges and articulation points of a graph and bipartite graph recognition. There already exist constant time algorithms to solve these problems on a mesh with reconfigurable bus system using O(N 4) processors. Here we show that these problems can be solved in constant time using only O(N 2) processors on the BSR model (N is the number of vertices of the graph G). Therefore, our algorithms are more work-efficient. These new results suggest that many other problems in graph theory can be solved in constant time using the BSR model.