Implementation of finding maximal clique for a chordal graph

Revision en1, by unitylessfifty, 2018-07-26 12:57:42

Hello everyone, I just read regarding chordal graphs and cliques from the article. Your text to link here...

There is a nice algorithm stated on how to find the maximal clique for a chordal graph. As per the algorithm given I thought a minimum heap(using priority queue in C++) storing both the degree and vertex number can help us to get the minimum degree ordering . Once we get the ordering knowing the size of maximal clique is a linear check . But the way I thought of getting the answer gives WA on a question of last JULY long Challenge of codechef . Link of the question : Your text to link here...

Can anyone please help me knowing what is the problem in this implementation ? I also checked successful submissions for the question which have an implementation similar to the one stated in the article stated earlier.

Thanks. Please help.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English unitylessfifty 2018-07-26 12:57:42 1237 Initial revision (published)