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 3, Pages 58–64 (Mi da690)  
This article is cited in 1 scientific paper (total in 1 paper)

Effective solvability of the independent set problem in a class of graphs without induced path and cycle with five vertices and a big clique

D. S. Malyshevab

a Nizhniy Novgorod State University, Nizhniy Novgorod, Russia
b Nizhniy Novgorod Higher School of Economics, Nizhniy Novgorod, Russia
Full-text PDF (253 kB) Citations (1)
References:
PDF
HTML
Abstract: An algorithm for finding the independence number of a $n$-vertex graph from the class $\operatorname{Free}(\{P_5,C_5,K_p\})$ in time $O(n^{p+O(1)})$ is proposed. Bibliogr. 10.
Keywords: the independent set problem, computational complexity, polynomial algorithm.
Received: 01.08.2011
Bibliographic databases:
Document Type: Article
UDC: 519.178
Language: Russian
Citation: D. S. Malyshev, “Effective solvability of the independent set problem in a class of graphs without induced path and cycle with five vertices and a big clique”, Diskretn. Anal. Issled. Oper., 19:3 (2012), 58–64
Citation in format AMSBIB
\Bibitem{Mal12}
\by D.~S.~Malyshev
\paper Effective solvability of the independent set problem in a~class of graphs without induced path and cycle with five vertices and a~big clique
\jour Diskretn. Anal. Issled. Oper.
\yr 2012
\vol 19
\issue 3
\pages 58--64
\mathnet{http://mi.mathnet.ru/da690}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2986641}
Linking options:
  • https://www.mathnet.ru/eng/da690
  • https://www.mathnet.ru/eng/da/v19/i3/p58
    • 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:330
    Full-text PDF :88
    References:49
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024