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, 2017, Volume 29, Issue 3, Pages 114–125
DOI: https://doi.org/10.4213/dm1440 (Mi dm1440) 		 
This article is cited in 1 scientific paper (total in 1 paper)

A method of graph reduction and its applications

D. V. sirotkin, D. S. Malyshev

National Research University – Higher School of Economics in Nizhny Novgorod
Full-text PDF (506 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1440
Abstract: The independent set problem for a given simple graph is to determine the size of a maximum set of its pairwise non-adjacent vertices. We propose a new way of graph reduction leading to a new proof of the NP-completeness of the independent set problem in the class of planar graphs and to the proof of NP-completeness of this problem in the class of planar graphs having only triangular internal facets of maximal vertex degree 18.
Keywords: independent sets, planar graph, planar triangulation, computational complexity.
Funding agency Grant number
Russian Science Foundation 17-11-01336
Исследование выполнено за счет гранта Российского научного фонда (проект № 17-11-01336).
Received: 16.12.2016
English version:
Discrete Mathematics and Applications, 2018, Volume 28, Issue 4, Pages 249–258
DOI: https://doi.org/10.1515/dma-2018-0022
Bibliographic databases:
UDC: 519.17
Language: Russian
Citation: D. V. sirotkin, D. S. Malyshev, “A method of graph reduction and its applications”, Diskr. Mat., 29:3 (2017), 114–125; Discrete Math. Appl., 28:4 (2018), 249–258
Citation in format AMSBIB
\Bibitem{SirMal17}
\by D.~V.~sirotkin, D.~S.~Malyshev
\paper A method of graph reduction and its applications
\jour Diskr. Mat.
\yr 2017
\vol 29
\issue 3
\pages 114--125
\mathnet{http://mi.mathnet.ru/dm1440}
\crossref{https://doi.org/10.4213/dm1440}
\elib{https://elibrary.ru/item.asp?id=29887805}
\transl
\jour Discrete Math. Appl.
\yr 2018
\vol 28
\issue 4
\pages 249--258
\crossref{https://doi.org/10.1515/dma-2018-0022}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000442245400004}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85053113965}
Linking options:
  • https://www.mathnet.ru/eng/dm1440
  • https://doi.org/10.4213/dm1440
  • https://www.mathnet.ru/eng/dm/v29/i3/p114
    • 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:483
    Full-text PDF :85
    References:53
    First page:28
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024