64,096 research outputs found
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 problems that have at least one of the following properties: the problems involve some type of dynamic updates; the sparsification technique is applicable; or the problems are closely related to communications network issues. The models of parallel computation used in our studies are the Parallel Random Access Machine (PRAM) model and the practical interconnection network models such as meshes and hypercubes. ¶ ..
Recommended from our members
Achieving interoperability between two domains : connecting the ZOTnet and UUCP computer mail networks
Communication Standards for Online Interchange of Library Information
published or submitted for publicatio
- …