Answer Happy

Design an algorithm and write a program to identify the minimum
vertex covers within the complement
graphs of the supplied graphs. The table below shows the output
from a current minimum vertex cover
solver for these complement graphs.
(a) You must actually design your own algorithm and write all
program code submitted. The
program must be able to be run from the command line passing the
target minimum vertex
cover size as an argument. The naming convention for your program
file is
<student_number>_mvc (without the <>) and try and keep
the program within a single file.
2
(b) As this a computationally intensive algorithm, you must use
C/C++, written using all possible
optimisations.
(c) You must produce a detailed Latex/Word paper containing an
Introduction, Literature Review,
Algorithm Description, Experimental Results and Comparisons and a
Conclusion.
(d) You must produce a Power-point presentation summarising your
algorithms, implementation,
testing and the results of the problem and performance analysis. Do
not include any code in
your powerpoint presentation.
Graph Minimum Vertex Cover Successful Trials Average CPU Time