Fast parallel algorithms for graphs and networks
Thesis/Dissertation
·
OSTI ID:5575747
Many theorems in graph theory give simple characterizations for testing the existence of objects with certain properties, which can be translated into fast parallel algorithms. However, transforming these tests into algorithms for Constructing such objects is often a real challenge. This thesis develops fast parallel (NC) algorithms for several such construction problems. The first part is about tournaments. (A tournament is a digraph in which there is precisely one arc between every two vertices.) Two classical results state that every tournament has a Hamiltonian path and every strongly connected tournament has a Hamiltonian cycle. The author derives efficient parallel algorithms for finding these objects. It is algorithms yield new proofs of these theorems. The second part is concerned with making graphs strongly connected via orientation and augmentation. A graph is strongly orientable if its edges can be assigned orientations to yield a strongly connected digraph. The final part of the thesis describes a methodology that yields deterministic parallel algorithms for several supply-demand problems on networks with zero-one capacities.
- Research Organization:
- California Univ., Berkeley, CA (USA)
- OSTI ID:
- 5575747
- Country of Publication:
- United States
- Language:
- English
Similar Records
Fast parallel algorithms for finding Hamiltonian paths and cycles in a tournament
Parallel algorithms for problems involving directed graphs
Fast parallel algorithms on a class of graph structures with applications in relational databases and computer networks
Book
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:5384589
Parallel algorithms for problems involving directed graphs
Thesis/Dissertation
·
Tue Dec 31 23:00:00 EST 1985
·
OSTI ID:7162931
Fast parallel algorithms on a class of graph structures with applications in relational databases and computer networks
Thesis/Dissertation
·
Sun Dec 31 23:00:00 EST 1989
·
OSTI ID:5900286