Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






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


Diskretnyi Analiz i Issledovanie Operatsii, 2012, Volume 19, Issue 4, Pages 66–72 (Mi da698)  

This article is cited in 1 scientific paper (total in 1 paper)

Polynomial solvability of the independent set problem for one class of graphs with small diameter

D. S. Malyshevab

a Nizhniy Novgorod Higher School of Economics, Nizhniy Novgorod, Russia
b Nizhniy Novgorod State University, Nizhniy Novgorod, Russia
Full-text PDF (228 kB) Citations (1)
References:
Abstract: A constructive approach to forming new cases in the family of hereditary parts of the set ${\mathcal Free}(\{P_5,C_5\})$ with polynomial-time solvability of the independent set problem is considered. We prove that if this problem is polynomial-time solvable in the class ${\mathcal Free}(\{P_5,C_5,G\})$ then for any graph $H$ which can inductively be obtained from $G$ by means of applying addition with $K_1$ or multiplication by $K_1$ to the graph $G$ the problem has the same computational status in ${\mathcal Free}(\{P_5,C_5,H\})$. Bibliogr. 10.
Keywords: the independent set problem, computational complexity, polynomial algorithm.
Received: 19.10.2011
Bibliographic databases:
Document Type: Article
UDC: 519.7
Language: Russian
Citation: D. S. Malyshev, “Polynomial solvability of the independent set problem for one class of graphs with small diameter”, Diskretn. Anal. Issled. Oper., 19:4 (2012), 66–72
Citation in format AMSBIB
\Bibitem{Mal12}
\by D.~S.~Malyshev
\paper Polynomial solvability of the independent set problem for one class of graphs with small diameter
\jour Diskretn. Anal. Issled. Oper.
\yr 2012
\vol 19
\issue 4
\pages 66--72
\mathnet{http://mi.mathnet.ru/da698}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3013544}
Linking options:
  • https://www.mathnet.ru/eng/da698
  • https://www.mathnet.ru/eng/da/v19/i4/p66
  • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:315
    Full-text PDF :79
    References:45
    First page:6
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024