Proceedings of the Institute for System Programming of the RAS
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Proceedings of ISP RAS:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Proceedings of the Institute for System Programming of the RAS, 2017, Volume 29, Issue 3, Pages 225–232
DOI: https://doi.org/10.15514/ISPRAS-2017-29(3)-12 (Mi tisp229) 		 
On the problem of finding approximation of bipatite cliques

N. N. Kuzyurin

Institute for System Programming RAS
Full-text PDF (488 kB)
References:
PDF
HTML
DOI: https://doi.org/10.15514/ISPRAS-2017-29(3)-12
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.
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: N. N. Kuzyurin, “On the problem of finding approximation of bipatite cliques”, Proceedings of ISP RAS, 29:3 (2017), 225–232
Citation in format AMSBIB
\Bibitem{Kuz17}
\by N.~N.~Kuzyurin
\paper On the problem of finding approximation of bipatite cliques
\jour Proceedings of ISP RAS
\yr 2017
\vol 29
\issue 3
\pages 225--232
\mathnet{http://mi.mathnet.ru/tisp229}
\crossref{https://doi.org/10.15514/ISPRAS-2017-29(3)-12}
\elib{https://elibrary.ru/item.asp?id=29438847}
Linking options:
  • https://www.mathnet.ru/eng/tisp229
  • https://www.mathnet.ru/eng/tisp/v29/i3/p225
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Proceedings of the Institute for System Programming of the RAS
    Statistics & downloads:
    Abstract page:223
    Full-text PDF :324
    References:36
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024