Closed
Clique Problem
Budget $10-30 USD
I want 2 methods to find the maximum clique in a graph.
First method: backtracking
Second method: the Bron–Kerbosch algorithm
I want you to create a set of tests that validate the efficiency of solutions.
(c++)
2 freelancers are bidding on average $40 for this job
talesmoraes2001
Hello. I read your description carefully and understand sufficiently. And I am very interesting for your project. I have enough experiences for C/C++/C#. I will send you full project in a short time. Looking forward to More
$10 USD in 1 day
(7 Reviews)
3.3