Geodesic
Minimal hard classes of graphs for the edge list-ranking problem
Diskretnyj analiz i issledovanie operacij, Tome 18 (2011) no. 1, pp. 70-76

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

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