Proceedings of ISP RAS


On the problem of finding approximation of bipatite cliques

N.N. Kuzyurin (ISP RAS, Moscow, Russia)

Abstract

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

Keywords

random graph; large hidden clique; finding complexity

Edition

Proceedings of the Institute for System Programming, vol. 29, issue 3, 2017, pp. 225-232.

ISSN 2220-6426 (Online), ISSN 2079-8156 (Print).

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

Full text of the paper in pdf (in Russian) Back to the contents of the volume