RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

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


Diskretn. Anal. Issled. Oper., 2017, Volume 24, Number 1, Pages 81–96 (Mi da864)  

Critical elements in combinatorially closed families of graph classes

D. S. Malyshevab

a Lobachevsky State University, 23 Gagarin Ave., 603950 Nizhny Novgorod, Russia
b National Research University Higher School of Economics, 25/12 Bolshaya Pecherskaya St., 603155 Nizhny Novgorod, Russia

Abstract: The notions of boundary and minimal hard classes of graphs, united by the term “critical classes”, are useful tools for analysis of computational complexity of graph problems in the family of hereditary graph classes. In this family, boundary classes are known for several graph problems. In the paper, we consider critical graph classes in the families of strongly hereditary and minor closed graph classes. Prior to our study, there was the only one example of a graph problem for which boundary classes were completely described in the family of strongly hereditary classes. Moreover, no boundary classes were known for any graph problem in the family of minor closed classes. In this article, we present several complete descriptions of boundary classes for these two families and some classical graph problems. For the problem of $2$-additive approximation of graph bandwidth, we find a boundary class in the family of minor closed classes. Critical classes are not known for this problem in the other two families of graph classes. Bibliogr. 21.

Keywords: computational complexity, hereditary class, critical class, efficient algorithm.

Funding Agency Grant Number
Russian Foundation for Basic Research 16-31-60008_мол_а_ дк
16-01-00599_а
16-31-00109_мол_а
Ministry of Education and Science of the Russian Federation MK-4819.2016.1


DOI: https://doi.org/10.17377/daio.2017.24.523

Full text: PDF file (344 kB)
References: PDF file   HTML file

English version:
Journal of Applied and Industrial Mathematics, 2017, 11:1, 99–106

Bibliographic databases:

UDC: 519.17
Received: 11.01.2016
Revised: 29.04.2016

Citation: D. S. Malyshev, “Critical elements in combinatorially closed families of graph classes”, Diskretn. Anal. Issled. Oper., 24:1 (2017), 81–96; J. Appl. Industr. Math., 11:1 (2017), 99–106

Citation in format AMSBIB
\Bibitem{Mal17}
\by D.~S.~Malyshev
\paper Critical elements in combinatorially closed families of graph classes
\jour Diskretn. Anal. Issled. Oper.
\yr 2017
\vol 24
\issue 1
\pages 81--96
\mathnet{http://mi.mathnet.ru/da864}
\crossref{https://doi.org/10.17377/daio.2017.24.523}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3622066}
\elib{http://elibrary.ru/item.asp?id=28905206}
\transl
\jour J. Appl. Industr. Math.
\yr 2017
\vol 11
\issue 1
\pages 99--106
\crossref{https://doi.org/10.1134/S1990478917010112}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85013983205}


Linking options:
  • http://mi.mathnet.ru/eng/da864
  • http://mi.mathnet.ru/eng/da/v24/i1/p81

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Дискретный анализ и исследование операций
    Number of views:
    This page:2615
    Full text:12
    References:21
    First page:11

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020