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, 2013, Volume 20, Issue 3, Pages 26–44 (Mi da730)  
This article is cited in 12 scientific papers (total in 12 papers)

Сlasses of subcubic planar graphs for which the independent set problem is polynomial-time solvable

D. S. Malyshevab

a Nizhniy Novgorod Higher School of Economics, 25/12 B. Pecherskaya St., 603155 Nizhny Novgorod, Russia
b Nizhniy Novgorod State University, 23 Gagarin Ave., 603950 Nizhniy Novgorod, Russia
Full-text PDF (313 kB) Citations (12)
References:
PDF
HTML
Abstract: Polynomial-time solvability of the independent set problem for some subclasses of subcubic planar graphs is proved. Bibliogr. 5.
Keywords: independent set problem, boundary class, computational complexity, effective algorithm.
Received: 10.11.2011
Revised: 19.11.2012
English version:
Journal of Applied and Industrial Mathematics, 2013, Volume 7, Issue 4, Pages 537–548
DOI: https://doi.org/10.1134/S199047891304008X
Bibliographic databases:
Document Type: Article
UDC: 519.178
Language: Russian
Citation: D. S. Malyshev, “Сlasses of subcubic planar graphs for which the independent set problem is polynomial-time solvable”, Diskretn. Anal. Issled. Oper., 20:3 (2013), 26–44; J. Appl. Industr. Math., 7:4 (2013), 537–548
Citation in format AMSBIB
\Bibitem{Mal13}
\by D.~S.~Malyshev
\paper Сlasses of subcubic planar graphs for which the independent set problem is polynomial-time solvable
\jour Diskretn. Anal. Issled. Oper.
\yr 2013
\vol 20
\issue 3
\pages 26--44
\mathnet{http://mi.mathnet.ru/da730}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3135742}
\transl
\jour J. Appl. Industr. Math.
\yr 2013
\vol 7
\issue 4
\pages 537--548
\crossref{https://doi.org/10.1134/S199047891304008X}
Linking options:
  • https://www.mathnet.ru/eng/da730
  • https://www.mathnet.ru/eng/da/v20/i3/p26
    • This publication is cited in the following 12 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:370
    Full-text PDF :69
    References:55
    First page:13
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024