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 1, Pages 70–76 (Mi da639)  
This article is cited in 5 scientific papers (total in 5 papers)

Minimal hard classes of graphs for the edge list-ranking problem

D. S. Malyshevab

a Nizhniy Novgorod State University, Nizhniy Novgorod, Russia
b Nizhniy Novgorod branch of Higher School of Economics, Nizhny Novgorod, Russia
Full-text PDF (235 kB) Citations (5)
References:
PDF
HTML
Abstract: We consider the notion of a minimal hard class of graphs for the edge list-ranking problem. We investigate the way of obtaining such classes and reveal a new class of this kind. We show completeness of a set of some classes of graphs as a system of minimal hard classes that can be obtained in the framework of the proposed approach. Bibliogr. 5.
Keywords: computational complexity, minimal hard class, edge list-ranking problem.
Received: 18.06.2010
Bibliographic databases:
Document Type: Article
UDC: 519.178
Language: Russian
Citation: D. S. Malyshev, “Minimal hard classes of graphs for the edge list-ranking problem”, Diskretn. Anal. Issled. Oper., 18:1 (2011), 70–76
Citation in format AMSBIB
\Bibitem{Mal11}
\by D.~S.~Malyshev
\paper Minimal hard classes of graphs for the edge list-ranking problem
\jour Diskretn. Anal. Issled. Oper.
\yr 2011
\vol 18
\issue 1
\pages 70--76
\mathnet{http://mi.mathnet.ru/da639}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2847830}
\zmath{https://zbmath.org/?q=an:1249.68138}
Linking options:
  • https://www.mathnet.ru/eng/da639
  • https://www.mathnet.ru/eng/da/v18/i1/p70
    • 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:479
    Full-text PDF :101
    References:47
    First page:8
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024