Parallel graph algorithms. (c2000)

LAUR Repository

Show simple item record

dc.contributor.author Itani, Wissam
dc.date.accessioned 2011-11-16T10:15:47Z
dc.date.available 2011-11-16T10:15:47Z
dc.date.issued 2011-11-16
dc.date.submitted 2000-06-21
dc.identifier.uri http://hdl.handle.net/10725/994
dc.description Includes bibliographical references ( leaves 61-64). en_US
dc.description.abstract One way the early use of parallel computers has resembled the early use of sequential computers has been the emphasis on numerical algorithms. However, as the field of parallel algorithms matures, the emphasis can be expected to shift to nonnumerical algorithms because more and more problems being solved on computers are symbolic in nature. This document examines a number of parallel algorithms developed to solve problems in graph theory. These problems relate to shortest paths in graphs and minimum-cost spanning trees. Chapter four is devoted to Moore's algorithm thus, it presents two parallel algorithms, one for solving the single-source shortest path (SSSP) problem and the second solve the all pairs shortest path (APSP) problem. Our focus in chapter five is on Dijkstra's algorithm; first, we describe the sequential SSSP algorithm, then we present a parallel formulation for solving APSP problems. Chapter six presents Prim's graph algorithm for computing the minimum spanning tree. en_US
dc.language.iso en en_US
dc.subject Computer software en_US
dc.subject Parallel algorithms en_US
dc.title Parallel graph algorithms. (c2000) en_US
dc.type Project en_US
dc.term.submitted Spring en_US
dc.author.degree MS in Computer Science en_US
dc.author.school Arts and Sciences en_US
dc.author.idnumber 199610840 en_US
dc.author.commembers Dr. May Abboud
dc.author.woa RA en_US
dc.description.physdesc 1 bound copy: vi, 89 leaves; ill.; 30 cm. Available at RNL. en_US
dc.author.division Computer Science en_US
dc.author.advisor Dr. Nashat Mansour
dc.publisher.institution Lebanese American University en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search LAUR

Advanced Search


My Account