On the problem of finding approximation of bipatite cliques
| Autor: | N.N. Kuzyurin |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Combinatorics
большая спрятанная клика Computer Science::Discrete Mathematics случайный граф TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY General Earth and Planetary Sciences сложность нахождения lcsh:Electronic computers. Computer science Intersection number (graph theory) lcsh:QA75.5-76.95 MathematicsofComputing_DISCRETEMATHEMATICS General Environmental Science Mathematics |
| Zdroj: | Труды Института системного программирования РАН, Vol 29, Iss 3, Pp 225-232 (2018) |
| ISSN: | 2220-6426 2079-8156 |
| DOI: | 10.15514/ispras-2017-29(3)-12 |
| Popis: | In this paper, we consider the problem of finding large hidden clique in random graph and it’s analog for bipartite graphs. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|