Skip navigation
Skip navigation

Designing Efficient Parallel Algorithms for Graph Problems

Liang, Weifa


Graph algorithms are concerned with the algorithmic aspects of solving graph problems. The problems are motivated from and have application to diverse areas of computer science, engineering and other disciplines. Problems arising from these areas of application are good candidates for parallelization since they often have both intense computational needs and stringent response time requirements. Motivated by these concerns, this thesis investigates parallel algorithms for these kinds of graph...[Show more]

CollectionsOpen Access Theses
Date published: 1997
Type: Thesis (PhD)


File Description SizeFormat Image
01front.pdf226.99 kBAdobe PDFThumbnail
02whole.pdf1.27 MBAdobe PDFThumbnail

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator