Find a maximum clique of a chordal graph.
Input: a txt file giving an adjacency list of the graph.Method: Each iteration remove a vertex with smallest degree from the graph if that degree is less than thenumber of remaining vertices minus 1.
Output: the vertex set of a maximum clique.
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"
