Parallel Algorithms For Graph Problems

Author

Panagiotis Metaxas, Dartmouth College

Date of Award

7-1991

Document Type

Thesis (Ph.D.)

Department or Program

Department of Computer Science

Abstract

In this thesis we examine three problems in graph theory and propose efficient parallel algorithms for solving them. We also introduce a number of parallel algorithmic techniques.

Comments

Originally posted in the Dartmouth College Computer Science Technical Report Series, number PCS-TR92-178.

Recommended Citation

Metaxas, Panagiotis, "Parallel Algorithms For Graph Problems" (1991). Dartmouth College Ph.D Dissertations. 65.
https://digitalcommons.dartmouth.edu/dissertations/65