On the problem of finding approximation of bipatite cliques

Abstract

In this paper, we consider the problem of finding large hidden clique in random graph and it’s analog for bipartite graphs.

Keywords

• случайный граф
• большая спрятанная клика
• сложность нахождения