BIB-VERSION:: CS-TR-v2.0
ID:: ncstrl.dartmouthcs//TR92-178
ENTRY:: January 20, 1995
ORGANIZATION:: Dartmouth College, Computer Science
TITLE:: Parallel Algorithms For Graph Problems (Thesis)
TYPE:: Technical Report (paper)
REVISION:: 1
AUTHOR:: Metaxas, Panagiotis
NOTE:: The 'January' in DATE is an arbitrary placeholder.
DATE:: January 1992
RETRIEVAL:: For a paper copy, email <reports@cs.dartmouth.edu>
RETRIEVAL:: For a paper copy, write to
       Technical Report Librarian
       Department of Computer Science
       Dartmouth College
       6211 Sudikoff Laboratory
       Hanover, NH 03755-3510
       USA
RETRIEVAL:: PDF at http://www.cs.dartmouth.edu/reports/TR92-178.pdf
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.
END:: ncstrl.dartmouthcs//TR92-178