Which algorithm is best appropriate for finding Vertex Cover over large graphs using parallel approach?

113 Views Asked by At

There are lots of algorithm for finding vertex cover of a graph but want to know the best algorithm that can be used as parallel approach for finding vertex cover over large graph, so which is best? As i have asked this question bcoz the importance of this problem in real word application is more like in Terrorist Communication N/w, Airline Communication N/w, Wireless Communication etc.

0

There are 0 best solutions below