Logo BSU

  1. Электронная библиотека БГУ
  2. Факультет прикладной математики и информатики
  3. НАУЧНЫЕ ПУБЛИКАЦИИ ФАКУЛЬТЕТА ПРИКЛАДНОЙ МАТЕМАТИКИ И ИНФОРМАТИКИ
  4. Статьи факультета прикладной математики и информатики
Issue Date Author Title Subject
Please use this identifier to cite or link to this item: https://elib.bsu.by/handle/123456789/341574
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLoverov, Y.A.-
dc.contributor.authorOrlovich, Y.L.-
dc.date.accessioned2026-02-13T11:12:33Z-
dc.date.available2026-02-13T11:12:33Z-
dc.date.issued2016-
dc.identifier.citationJ. Appl. Industr. Math.2020; 14(2): 352–366ru
dc.identifier.urihttps://elib.bsu.by/handle/123456789/341574-
dc.description.abstractIt 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. Still open is the question about the computational complexity of the problem in the intersection of these graph classes. In this article, we prove that the independent dominating set problem is NP-complete in the class of cubic planar bipartite graphs.ru
dc.language.isoenru
dc.publisherPleiades Publishing, Ltd.ru
dc.rightsinfo:eu-repo/semantics/openAccessru
dc.subjectЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Кибернетикаru
dc.titleNP-Completeness of the Independent Dominating Set Problem in the Class of Cubic Planar Bipartite Graphsru
dc.typearticleru
dc.rights.licenseCC BY 4.0ru
dc.identifier.DOI10.1134/S1990478920020131-
dc.identifier.orcid0000-0002-6398-8306ru
Appears in Collections:Статьи факультета прикладной математики и информатики

Files in This Item:
File Description SizeFormat 
S1990478920020131.pdf1,14 MBAdobe PDFView/Open
Show simple item record Google Scholar



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.