Parallel algorithms for problems involving directed graphs
Thesis/Dissertation
·
OSTI ID:7162931
Graph theory is widely applied in a variety of areas. Problems involving directed graphs are substantially more complicated than the corresponding problems for undirected graphs. The main results of this paper are algorithms proposed for the following problems: (1) breadth-first spanning forests for general graphs; (2) Minimal spanning forests for general digraphs; and (3) 1-bases for special graphs. All of the algorithms in this thesis have polylogarithmic time complexity and polynomial processor complexity. Two counterexamples for a parallel algorithm proposed by Ghosh and Bhattacharjee for depth-first spanning trees of acyclic digraphs (BIT 24 1984) are given. In addition, the necessary and sufficient conditions for the algorithm to fail (or to succeed) are given.
- Research Organization:
- Drexel Univ., Philadelphia, PA (USA)
- OSTI ID:
- 7162931
- Country of Publication:
- United States
- Language:
- English
Similar Records
Incremental graph algorithms for parallel random access machines
Fast parallel algorithms for graphs and networks
Parallel algorithms on modified SIMD machines
Thesis/Dissertation
·
Tue Dec 31 23:00:00 EST 1985
·
OSTI ID:6918186
Fast parallel algorithms for graphs and networks
Thesis/Dissertation
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:5575747
Parallel algorithms on modified SIMD machines
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1983
·
OSTI ID:5900889