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., 2012, Volume 19, Number 1, Pages 74–96 (Mi da678)  

This article is cited in 2 scientific papers (total in 2 papers)

The complexity analysis of the edge-ranking problem for hereditary graph classes with at most three prohibitions

D. S. Malyshevab

a Nizhniy Novgorod State University, Nizhniy Novgorod, Russia
b Nizhniy Novgorod branch of Higher School of Economics, Nizhniy Novgorod, Russia

Abstract: We completely characterize all hereditary classes defined by at most three forbidden induced subgraphs (obstructions) for which the edge list-ranking problem is polynomial-time solvable. For each class in this family, the algorithm of determining the complexity status of the problem in the class is based on checking whether or not the obstructions belong to some special (“critical”) classes of graphs. The family of such special classes includes, in particular, inclusionwise minimal classes for which the problem is NP-complete. All classes of this type defined by at most three obstructions are described. Ill. 4, bibliogr. 14.

Keywords: computational complexity, minimal hard class, boundary class, edge list-ranking problem, polynomial algorithm.

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

Bibliographic databases:
UDC: 519.178
Received: 31.05.2011
Revised: 02.11.2011

Citation: D. S. Malyshev, “The complexity analysis of the edge-ranking problem for hereditary graph classes with at most three prohibitions”, Diskretn. Anal. Issled. Oper., 19:1 (2012), 74–96

Citation in format AMSBIB
\Bibitem{Mal12}
\by D.~S.~Malyshev
\paper The complexity analysis of the edge-ranking problem for hereditary graph classes with at most three prohibitions
\jour Diskretn. Anal. Issled. Oper.
\yr 2012
\vol 19
\issue 1
\pages 74--96
\mathnet{http://mi.mathnet.ru/da678}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2961453}


Linking options:
  • http://mi.mathnet.ru/eng/da678
  • http://mi.mathnet.ru/eng/da/v19/i1/p74

    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

    This publication is cited in the following articles:
    1. Alekseev V.E., Zakharova D.V., Malyshev D.S., Mokeev D.B., Sorochan S.V., “Nekotorye rezultaty o nasledstvennykh klassakh grafov. ii”, Vestnik nizhegorodskogo universiteta im. N.I. Lobachevskogo, 2012, 115–120  elib
    2. D. S. Malyshev, “Critical graph classes for the edge list-ranking problem”, J. Appl. Industr. Math., 8:2 (2014), 245–255  mathnet  crossref  mathscinet
  • Дискретный анализ и исследование операций
    Number of views:
    This page:304
    Full text:59
    References:30
    First page:11

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