Geodesic
A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon
Discrete mathematics & theoretical computer science, Tome 17 (2015-2016) no. 1.

Voir la notice de l'article provenant de la source Episciences

Discrete Algorithms 
@article{DMTCS_2015_17_1_a25,
     author = {Cabello, Sergio and Saumell, Maria},
     title = {A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {17},
     number = {1},
     year = {2015-2016},
     doi = {10.46298/dmtcs.2126},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2126/}
}
TY  - JOUR
AU  - Cabello, Sergio
AU  - Saumell, Maria
TI  - A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon
JO  - Discrete mathematics & theoretical computer science
PY  - 2015-2016
VL  - 17
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2126/
DO  - 10.46298/dmtcs.2126
LA  - en
ID  - DMTCS_2015_17_1_a25
ER  - 
%0 Journal Article
%A Cabello, Sergio
%A Saumell, Maria
%T A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon
%J Discrete mathematics & theoretical computer science
%D 2015-2016
%V 17
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2126/
%R 10.46298/dmtcs.2126
%G en
%F DMTCS_2015_17_1_a25
Cabello, Sergio; Saumell, Maria. A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon. Discrete mathematics & theoretical computer science, Tome 17 (2015-2016) no. 1. doi : 10.46298/dmtcs.2126. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2126/

Cité par Sources :