A Parallel Algorithm to Test Chordality of Graphs
Distributed, Parallel, and Cluster Computing
2015-08-27 v1 Data Structures and Algorithms
Abstract
We present a simple parallel algorithm to test chordality of graphs which is based on the parallel Lexicographical Breadth-First Search algorithm. In total, the algorithm takes time O(N ) on N-threads machine and it performs work O(N 2 ) , where N is the number of vertices in a graph. Our implementation of the algorithm uses a GPU environment Nvidia CUDA C. The algorithm is implemented in CUDA 4.2 and it has been tested on Nvidia GeForce GTX 560 Ti of compute capability 2.1. At the end of the thesis we present the results achieved by our implementation and compare them with the results achieved by the sequential algorithm
Keywords
Cite
@article{arxiv.1508.06329,
title = {A Parallel Algorithm to Test Chordality of Graphs},
author = {Agnieszka Lupinska},
journal= {arXiv preprint arXiv:1508.06329},
year = {2015}
}
Comments
MSc thesis, promoter: dr Maciej \'Slusarek