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, 2020, Volume 27, Issue 2, Pages 65–89
DOI: https://doi.org/10.33048/daio.2020.27.657 (Mi da951) 		 
This article is cited in 3 scientific papers (total in 3 papers)

NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs

Ya. A. Loverov, Yu. L. Orlovich

Belarusian State University, Nezavisimosti Avenue, 4, 220030 Minsk, Belarus
Full-text PDF (403 kB) Citations (3)
References:
PDF
HTML
DOI: https://doi.org/10.33048/daio.2020.27.657
Abstract: It is known that the independent dominating set problem is NP-complete both in the class of cubic planar graphs and in the class of cubic bipartite graphs. The question about the computational complexity of the problem in the intersection of these graph classes has remained open. In this article, we prove that the independent dominating set problem is NP-complete in the class of cubic planar bipartite graphs. Tab. 1, illustr. 7, bibliogr. 19.
Keywords: independent dominating set, cubic graph, planar graph, bipartite graph, NP-completeness.
Funding agency Grant number
Belarusian Republican Foundation for Fundamental Research Ф20УКА-005
This research is supported by the Belorussian Republic Foundation for Basic Research (Project Ф20УКА–005).
Received: 11.04.2019
Revised: 20.12.2019
Accepted: 13.01.2020
English version:
Journal of Applied and Industrial Mathematics, 2020, Volume 14, Issue 2, Pages 352–366
DOI: https://doi.org/10.1134/S1990478920020131
Bibliographic databases:
Document Type: Article
UDC: 519.17
Language: Russian
Citation: Ya. A. Loverov, Yu. L. Orlovich, “NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs”, Diskretn. Anal. Issled. Oper., 27:2 (2020), 65–89; J. Appl. Industr. Math., 14:2 (2020), 352–366
Citation in format AMSBIB
\Bibitem{LovOrl20}
\by Ya.~A.~Loverov, Yu.~L.~Orlovich
\paper NP-completeness of the independent dominating set problem in the class of cubic planar bipartite~graphs
\jour Diskretn. Anal. Issled. Oper.
\yr 2020
\vol 27
\issue 2
\pages 65--89
\mathnet{http://mi.mathnet.ru/da951}
\crossref{https://doi.org/10.33048/daio.2020.27.657}
\transl
\jour J. Appl. Industr. Math.
\yr 2020
\vol 14
\issue 2
\pages 352--366
\crossref{https://doi.org/10.1134/S1990478920020131}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85087746982}
Linking options:
  • https://www.mathnet.ru/eng/da951
  • https://www.mathnet.ru/eng/da/v27/i2/p65
    • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024