Weighted clique and biclique covering

Collaboration with Dr. Behnaz Omoomi and Akbar Davoodi.

The clique (biclique) cover number of a graph G is the minimum number of cliques (bicliques) covering all edges of G. In this project we are interested in minimizing the sum of size of cliques (bicliques) covering all edges.