Geodesic
Effective solvability of the independent set problem in a~class of graphs without induced path and cycle with five vertices and a~big clique
Diskretnyj analiz i issledovanie operacij, Tome 19 (2012) no. 3, pp. 58-64

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

An algorithm for finding the independence number of a $n$-vertex graph from the class $\operatorname{Free}(\{P_5,C_5,K_p\})$ in time $O(n^{p+O(1)})$ is proposed. Bibliogr. 10.
Keywords: the independent set problem, computational complexity
Mots-clés : polynomial algorithm. 
@article{DA_2012_19_3_a4,
     author = {D. S. Malyshev},
     title = {Effective solvability of the independent set problem in a~class of graphs without induced path and cycle with five vertices and a~big clique},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {58--64},
     publisher = {mathdoc},
     volume = {19},
     number = {3},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2012_19_3_a4/}
}
TY  - JOUR
AU  - D. S. Malyshev
TI  - Effective solvability of the independent set problem in a~class of graphs without induced path and cycle with five vertices and a~big clique
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2012
SP  - 58
EP  - 64
VL  - 19
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2012_19_3_a4/
LA  - ru
ID  - DA_2012_19_3_a4
ER  - 
%0 Journal Article
%A D. S. Malyshev
%T Effective solvability of the independent set problem in a~class of graphs without induced path and cycle with five vertices and a~big clique
%J Diskretnyj analiz i issledovanie operacij
%D 2012
%P 58-64
%V 19
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2012_19_3_a4/
%G ru
%F DA_2012_19_3_a4
D. S. Malyshev. Effective solvability of the independent set problem in a~class of graphs without induced path and cycle with five vertices and a~big clique. Diskretnyj analiz i issledovanie operacij, Tome 19 (2012) no. 3, pp. 58-64. http://geodesic.mathdoc.fr/item/DA_2012_19_3_a4/