A Recursive Algorithm for the Maximum Cardinality Independent set
Ευκλείδης Γ, Tome 21 (1989), pp. 87-110 Cet article a éte moissonné depuis la source Hellenic Digital Mathematics Library

Voir la notice de l'article

@article{EUG_1989_21_a8,
     author = {E. Loukakis},
     title = {A {Recursive} {Algorithm} for the {Maximum} {Cardinality} {Independent} set},
     journal = {E\ensuremath{\upsilon}\ensuremath{\kappa}\ensuremath{\lambda}\ensuremath{\varepsilon}\ensuremath{\acute\iota}\ensuremath{\delta}\ensuremath{\eta}\ensuremath{\varsigma} \ensuremath{\Gamma}},
     pages = {87--110},
     year = {1989},
     volume = {21},
     language = {gr},
     url = {http://geodesic.mathdoc.fr/item/EUG_1989_21_a8/}
}
TY  - JOUR
AU  - E. Loukakis
TI  - A Recursive Algorithm for the Maximum Cardinality Independent set
JO  - Ευκλείδης Γ
PY  - 1989
SP  - 87
EP  - 110
VL  - 21
UR  - http://geodesic.mathdoc.fr/item/EUG_1989_21_a8/
LA  - gr
ID  - EUG_1989_21_a8
ER  - 
%0 Journal Article
%A E. Loukakis
%T A Recursive Algorithm for the Maximum Cardinality Independent set
%J Ευκλείδης Γ
%D 1989
%P 87-110
%V 21
%U http://geodesic.mathdoc.fr/item/EUG_1989_21_a8/
%G gr
%F EUG_1989_21_a8
E. Loukakis. A Recursive Algorithm for the Maximum Cardinality Independent set. Ευκλείδης Γ, Tome 21 (1989), pp. 87-110. http://geodesic.mathdoc.fr/item/EUG_1989_21_a8/