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, 2009, Volume 16, Issue 6, Pages 43–51 (Mi da593)  
This article is cited in 11 scientific papers (total in 11 papers)

On minimal hard classes of graphs

D. S. Malyshev

Nizhegorodskiy State University, N. Novgorod, Russia
Full-text PDF (231 kB) Citations (11)
References:
PDF
HTML
Abstract: We consider the notions of a minimal hard class of graphs and a boundary class of graphs. We prove that there is no minimal hard classes for problem of recognition belonging to a hereditary class. We point out boundary and minimal hard classes of graphs for the list-ranking problems. These classes of graphs are the first examples of minimal hard classes and the first examples of hard boundary classes. Bibl. 9.
Keywords: computational complexity, minimal hard class, boundary class, recognition of hereditary property, list-ranking problems.
Received: 10.04.2009
Revised: 20.07.2009
Bibliographic databases:
UDC: 519.178
Language: Russian
Citation: D. S. Malyshev, “On minimal hard classes of graphs”, Diskretn. Anal. Issled. Oper., 16:6 (2009), 43–51
Citation in format AMSBIB
\Bibitem{Mal09}
\by D.~S.~Malyshev
\paper On minimal hard classes of graphs
\jour Diskretn. Anal. Issled. Oper.
\yr 2009
\vol 16
\issue 6
\pages 43--51
\mathnet{http://mi.mathnet.ru/da593}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2649141}
\zmath{https://zbmath.org/?q=an:1249.05368}
Linking options:
  • https://www.mathnet.ru/eng/da593
  • https://www.mathnet.ru/eng/da/v16/i6/p43
    • This publication is cited in the following 11 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:497
    Full-text PDF :97
    References:44
    First page:7
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024