an exhaustive search algorithm to solve the independent set problem in parallel n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
“An exhaustive search algorithm to solve the independent set problem in parallel.” PowerPoint Presentation
Download Presentation
“An exhaustive search algorithm to solve the independent set problem in parallel.”

Loading in 2 Seconds...

play fullscreen
1 / 7

“An exhaustive search algorithm to solve the independent set problem in parallel.” - PowerPoint PPT Presentation


  • 125 Views
  • Uploaded on

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

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

“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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
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

understanding concepts

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
understanding concepts1

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
example of an independent set

Independent set of size 9(Blue vertices)

Example of an independent set

Image Source: http://en.wikipedia.org/wiki/File:Independent_set_graph.svg

exhaustive search algorithm

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
slide7

THANK YOU

Questions, if any.