Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnaya Matematika, 2013, Volume 25, Issue 2, Pages 63–67
DOI: https://doi.org/10.4213/dm1234 (Mi dm1234) 		 
This article is cited in 4 scientific papers (total in 4 papers)

The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem

D. S. Malyshev
Full-text PDF (147 kB) Citations (4)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1234
Received: 23.05.2011
English version:
Discrete Mathematics and Applications, 2013, Volume 23, Issue 3-4, Pages 245–249
DOI: https://doi.org/10.1515/dma-2013-017
Bibliographic databases:
Document Type: Article
UDC: 519.178
Language: Russian
Citation: D. S. Malyshev, “The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem”, Diskr. Mat., 25:2 (2013), 63–67; Discrete Math. Appl., 23:3-4 (2013), 245–249
Citation in format AMSBIB
\Bibitem{Mal13}
\by D.~S.~Malyshev
\paper The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem
\jour Diskr. Mat.
\yr 2013
\vol 25
\issue 2
\pages 63--67
\mathnet{http://mi.mathnet.ru/dm1234}
\crossref{https://doi.org/10.4213/dm1234}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3156633}
\elib{https://elibrary.ru/item.asp?id=20730474}
\transl
\jour Discrete Math. Appl.
\yr 2013
\vol 23
\issue 3-4
\pages 245--249
\crossref{https://doi.org/10.1515/dma-2013-017}
\elib{https://elibrary.ru/item.asp?id=22056261}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84894534425}
Linking options:
  • https://www.mathnet.ru/eng/dm1234
  • https://doi.org/10.4213/dm1234
  • https://www.mathnet.ru/eng/dm/v25/i2/p63
    • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:423
    Full-text PDF :162
    References:45
    First page:19
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024