1 / 7

“An exhaustive search algorithm to solve the independent set problem in parallel.”

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

tamara-rodriquez
Télécharger la présentation

“An exhaustive search algorithm to solve the independent set problem in parallel.”

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 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

  2. 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

  3. 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

  4. Independent set of size 9(Blue vertices) Example of an independent set Image Source: http://en.wikipedia.org/wiki/File:Independent_set_graph.svg

  5. 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

  6. Live Demo

  7. THANK YOU Questions, if any.

More Related