RUS  ENG
Full version
JOURNALS // Proceedings of the Institute for System Programming of the RAS // Archive
Proceedings of ISP RAS, 2017 Volume 29, Issue 3, Pages 225–232 (Mi tisp229)
On the problem of finding approximation of bipatite cliques

N. N. Kuzyurin

Institute for System Programming RAS

Abstract: In this paper, we consider the problem of finding large hidden clique in random graph and its analog for bipartite graphs.

Keywords: random graph, large hidden clique, finding complexity.

DOI: 10.15514/ISPRAS-2017-29(3)-12



Bibliographic databases:

© Steklov Math. Inst. of RAS, 2026