Designing Efficient Parallel Algorithms for Graph Problems
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]
|Collections||Open Access Theses|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.