Geodesic
A~polynomial algorithm for finding the largest independent sets in claw-free graphs
Diskretnyj analiz i issledovanie operacij, Tome 6 (1999) no. 4, pp. 3-19.

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

@article{DA_1999_6_4_a0,
     author = {V. E. Alekseev},
     title = {A~polynomial algorithm for finding the largest independent sets in claw-free graphs},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {3--19},
     publisher = {mathdoc},
     volume = {6},
     number = {4},
     year = {1999},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_1999_6_4_a0/}
}
TY  - JOUR
AU  - V. E. Alekseev
TI  - A~polynomial algorithm for finding the largest independent sets in claw-free graphs
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 1999
SP  - 3
EP  - 19
VL  - 6
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_1999_6_4_a0/
LA  - ru
ID  - DA_1999_6_4_a0
ER  - 
%0 Journal Article
%A V. E. Alekseev
%T A~polynomial algorithm for finding the largest independent sets in claw-free graphs
%J Diskretnyj analiz i issledovanie operacij
%D 1999
%P 3-19
%V 6
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_1999_6_4_a0/
%G ru
%F DA_1999_6_4_a0
V. E. Alekseev. A~polynomial algorithm for finding the largest independent sets in claw-free graphs. Diskretnyj analiz i issledovanie operacij, Tome 6 (1999) no. 4, pp. 3-19. http://geodesic.mathdoc.fr/item/DA_1999_6_4_a0/