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, 2011, Volume 18, Issue 6, Pages 61–70 (Mi da670)  
This article is cited in 5 scientific papers (total in 5 papers)

Boundary classes for the list-ranking problems in subclasses of forests

D. S. Malysheva, V. E. Alekseevb

a Nizhniy Novgorod Higher School of Economics, Nizhny Novgorod, Russia
b Nizhniy Novgorod State University, Nizhniy Novgorod, Russia
Full-text PDF (266 kB) Citations (5)
References:
PDF
HTML
Abstract: All boundary classes are found for the graph list-ranking problems (vertex and edge variants) relative to the class of forests. It allows to determine the complexity status of these problems for any hereditary class defined by a finite set of forbidden subgraphs under the class of forests. Bibliogr. 9.
Keywords: computational complexity, boundary class, relative boundary class, list-ranking problem, forest.
Received: 19.01.2011
Revised: 09.08.2011
Bibliographic databases:
Document Type: Article
UDC: 519.178
Language: Russian
Citation: D. S. Malyshev, V. E. Alekseev, “Boundary classes for the list-ranking problems in subclasses of forests”, Diskretn. Anal. Issled. Oper., 18:6 (2011), 61–70
Citation in format AMSBIB
\Bibitem{MalAle11}
\by D.~S.~Malyshev, V.~E.~Alekseev
\paper Boundary classes for the list-ranking problems in subclasses of forests
\jour Diskretn. Anal. Issled. Oper.
\yr 2011
\vol 18
\issue 6
\pages 61--70
\mathnet{http://mi.mathnet.ru/da670}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2953800}
\zmath{https://zbmath.org/?q=an:1249.05369}
Linking options:
  • https://www.mathnet.ru/eng/da670
  • https://www.mathnet.ru/eng/da/v18/i6/p61
    • This publication is cited in the following 5 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:435
    Full-text PDF :84
    References:57
    First page:6
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024