Geodesic
The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem
Diskretnaya Matematika, Tome 25 (2013) no. 2, pp. 63-67

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

@article{DM_2013_25_2_a5,
     author = {D. S. Malyshev},
     title = {The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem},
     journal = {Diskretnaya Matematika},
     pages = {63--67},
     publisher = {mathdoc},
     volume = {25},
     number = {2},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2013_25_2_a5/}
}
TY  - JOUR
AU  - D. S. Malyshev
TI  - The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem
JO  - Diskretnaya Matematika
PY  - 2013
SP  - 63
EP  - 67
VL  - 25
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2013_25_2_a5/
LA  - ru
ID  - DM_2013_25_2_a5
ER  - 
%0 Journal Article
%A D. S. Malyshev
%T The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem
%J Diskretnaya Matematika
%D 2013
%P 63-67
%V 25
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2013_25_2_a5/
%G ru
%F DM_2013_25_2_a5
D. S. Malyshev. The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem. Diskretnaya Matematika, Tome 25 (2013) no. 2, pp. 63-67. http://geodesic.mathdoc.fr/item/DM_2013_25_2_a5/