Parallel Algorithms for Graph Theoretic Problems.
Abstract
The existence of parallel computers has motivated the development of parallel problems solving techniques for many problems. Techniques are studied for solving graph problems on an unbounded parallel model of computation. It is shown that solutions to graph problems can be organized to reveal a large amount of parallelism, which can be exploited to substantially reduce the computation time. Precisely, for an appropriate measure of time complexity, algorithms of time complexity 0 log-squared n are developed to solve each of the following problems for graphs with n vertices: finding minimum spanning trees, biconnected components, dominators, bridges, cycles, cycle bases, and shortest cycles. The number of processors needed to execute each algorithm is bounded above by a polynomial function of n. It is shown that 2 log n + c is a lower bound on the time required to solve each of these graph problems. Thus, the algorithms obtained have time complexities which are optimal to within a factor of log n.
Document Details
- Document Type
- Technical Report
- Publication Date
- Aug 01, 1977
- Accession Number
- ADA056888
Entities
People
- Carla Diane Savage
Organizations
- University of Illinois Urbana–Champaign