On the problem of finding approximation of bipatite cliques
In this paper, we consider the problem of finding large hidden clique in random graph and it’s analog for bipartite graphs.
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Ivannikov Institute for System Programming of the Russian Academy of Sciences
2018-10-01
|
| Series: | Труды Института системного программирования РАН |
| Subjects: | |
| Online Access: | https://ispranproceedings.elpub.ru/jour/article/view/285 |
| id |
doaj-5a7929920fc74f059c0cc5f681bf4be0 |
|---|---|
| record_format |
Article |
| spelling |
doaj-5a7929920fc74f059c0cc5f681bf4be02020-11-25T00:49:14Zeng Ivannikov Institute for System Programming of the Russian Academy of SciencesТруды Института системного программирования РАН2079-81562220-64262018-10-0129322523210.15514/ISPRAS-2017-29(3)-12285On the problem of finding approximation of bipatite cliquesNikolay N. Kuzyurin0Интитут системного программирования РАНIn this paper, we consider the problem of finding large hidden clique in random graph and it’s analog for bipartite graphs.https://ispranproceedings.elpub.ru/jour/article/view/285случайный графбольшая спрятанная кликасложность нахождения |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Nikolay N. Kuzyurin |
| spellingShingle |
Nikolay N. Kuzyurin On the problem of finding approximation of bipatite cliques Труды Института системного программирования РАН случайный граф большая спрятанная клика сложность нахождения |
| author_facet |
Nikolay N. Kuzyurin |
| author_sort |
Nikolay N. Kuzyurin |
| title |
On the problem of finding approximation of bipatite cliques |
| title_short |
On the problem of finding approximation of bipatite cliques |
| title_full |
On the problem of finding approximation of bipatite cliques |
| title_fullStr |
On the problem of finding approximation of bipatite cliques |
| title_full_unstemmed |
On the problem of finding approximation of bipatite cliques |
| title_sort |
on the problem of finding approximation of bipatite cliques |
| publisher |
Ivannikov Institute for System Programming of the Russian Academy of Sciences |
| series |
Труды Института системного программирования РАН |
| issn |
2079-8156 2220-6426 |
| publishDate |
2018-10-01 |
| description |
In this paper, we consider the problem of finding large hidden clique in random graph and it’s analog for bipartite graphs. |
| topic |
случайный граф большая спрятанная клика сложность нахождения |
| url |
https://ispranproceedings.elpub.ru/jour/article/view/285 |
| work_keys_str_mv |
AT nikolaynkuzyurin ontheproblemoffindingapproximationofbipatitecliques |
| _version_ |
1725252170102603776 |