Geodesic
Boundary classes for the list-ranking problems in subclasses of forests
Diskretnyj analiz i issledovanie operacij, Tome 18 (2011) no. 6, pp. 61-70

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

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. 
@article{DA_2011_18_6_a3,
     author = {D. S. Malyshev and V. E. Alekseev},
     title = {Boundary classes for the list-ranking problems in subclasses of forests},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {61--70},
     publisher = {mathdoc},
     volume = {18},
     number = {6},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2011_18_6_a3/}
}
TY  - JOUR
AU  - D. S. Malyshev
AU  - V. E. Alekseev
TI  - Boundary classes for the list-ranking problems in subclasses of forests
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2011
SP  - 61
EP  - 70
VL  - 18
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2011_18_6_a3/
LA  - ru
ID  - DA_2011_18_6_a3
ER  - 
%0 Journal Article
%A D. S. Malyshev
%A V. E. Alekseev
%T Boundary classes for the list-ranking problems in subclasses of forests
%J Diskretnyj analiz i issledovanie operacij
%D 2011
%P 61-70
%V 18
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2011_18_6_a3/
%G ru
%F DA_2011_18_6_a3
D. S. Malyshev; V. E. Alekseev. Boundary classes for the list-ranking problems in subclasses of forests. Diskretnyj analiz i issledovanie operacij, Tome 18 (2011) no. 6, pp. 61-70. http://geodesic.mathdoc.fr/item/DA_2011_18_6_a3/