Geodesic
A Comparison of Algorithms for the Maximum Clique Problem
Yugoslav journal of operations research, Tome 2 (1992) no. 1, p. 3
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

Voir la notice de l'article

Five recent practically efficient method for solving the maximum clique problem are briefly described and compared on randomly generated graphs.
Keywords: Graph, clique, algorithm. 
@article{YJOR_1992_2_1_a0,
     author = {Pierre Hansen and Nenad Mladenovi\'c},
     title = {A {Comparison} of {Algorithms} for the {Maximum} {Clique} {Problem}},
     journal = {Yugoslav journal of operations research},
     pages = {3 },
     year = {1992},
     volume = {2},
     number = {1},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/YJOR_1992_2_1_a0/}
}
TY  - JOUR
AU  - Pierre Hansen
AU  - Nenad Mladenović
TI  - A Comparison of Algorithms for the Maximum Clique Problem
JO  - Yugoslav journal of operations research
PY  - 1992
SP  - 3 
VL  - 2
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/YJOR_1992_2_1_a0/
LA  - en
ID  - YJOR_1992_2_1_a0
ER  - 
%0 Journal Article
%A Pierre Hansen
%A Nenad Mladenović
%T A Comparison of Algorithms for the Maximum Clique Problem
%J Yugoslav journal of operations research
%D 1992
%P 3 
%V 2
%N 1
%U http://geodesic.mathdoc.fr/item/YJOR_1992_2_1_a0/
%G en
%F YJOR_1992_2_1_a0
Pierre Hansen; Nenad Mladenović. A Comparison of Algorithms for the Maximum Clique Problem. Yugoslav journal of operations research, Tome 2 (1992) no. 1, p. 3 . http://geodesic.mathdoc.fr/item/YJOR_1992_2_1_a0/