Geodesic
On minimal hard classes of graphs
Diskretnyj analiz i issledovanie operacij, Tome 16 (2009) no. 6, pp. 43-51

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{DA_2009_16_6_a3,
     author = {D. S. Malyshev},
     title = {On minimal hard classes of graphs},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {43--51},
     publisher = {mathdoc},
     volume = {16},
     number = {6},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2009_16_6_a3/}
}
TY  - JOUR
AU  - D. S. Malyshev
TI  - On minimal hard classes of graphs
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2009
SP  - 43
EP  - 51
VL  - 16
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2009_16_6_a3/
LA  - ru
ID  - DA_2009_16_6_a3
ER  - 
%0 Journal Article
%A D. S. Malyshev
%T On minimal hard classes of graphs
%J Diskretnyj analiz i issledovanie operacij
%D 2009
%P 43-51
%V 16
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2009_16_6_a3/
%G ru
%F DA_2009_16_6_a3
D. S. Malyshev. On minimal hard classes of graphs. Diskretnyj analiz i issledovanie operacij, Tome 16 (2009) no. 6, pp. 43-51. http://geodesic.mathdoc.fr/item/DA_2009_16_6_a3/