70 likes | 234 Views
Parallel Computing I. Agarwal, Kshitij Ghosh , Aurodeep Elbahi , Reda. “An exhaustive search algorithm to solve the independent set problem in parallel.”. Project Mentor – Prof. Alan Kaminsky. Independent set NP problem Set of vertices in a graph
E N D
Parallel Computing I Agarwal, Kshitij Ghosh, Aurodeep Elbahi, Reda “An exhaustive search algorithm to solve the independent set problem in parallel.” Project Mentor – Prof. Alan Kaminsky
Independent set NP problem • Set of vertices in a graph • Property of the independent set of vertices is that no two vertices are adjacent • If there is set of 5 vertices that are independent, then no two vertices in this set of 5 vertices can have a direct edge between them Understanding Concepts
Independent set(contd.) • Size of an independent set • The number of vertices it contains, is the size of the vertices in the independent set. Understanding Concepts
Independent set of size 9(Blue vertices) Example of an independent set Image Source: http://en.wikipedia.org/wiki/File:Independent_set_graph.svg
Generated the matrix using the random number generator • Matrix stores the graph • Generation of all possible subsets of a size k • Finding all the independent sets of size k Exhaustive search algorithm
THANK YOU Questions, if any.