Geodesic
Finding hidden cliques in linear time
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10) (2010).

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

In the hidden clique problem, one needs to find the maximum clique in an $n$-vertex graph that has a clique of size $k$ but is otherwise random. An algorithm of Alon, Krivelevich and Sudakov that is based on spectral techniques is known to solve this problem (with high probability over the random choice of input graph) when $k \geq c \sqrt{n}$ for a sufficiently large constant $c$. In this manuscript we present a new algorithm for finding hidden cliques. It too provably works when $k > c \sqrt{n}$ for a sufficiently large constant $c$. However, our algorithm has the advantage of being much simpler (no use of spectral techniques), running faster (linear time), and experiments show that the leading constant $c$ is smaller than in the spectral approach. We also present linear time algorithms that experimentally find even smaller hidden cliques, though it remains open whether any of these algorithms finds hidden cliques of size $o(\sqrt{n})$. 
@article{DMTCS_2010_special_258_a38,
     author = {Feige, Uriel and Ron, Dorit},
     title = {Finding hidden cliques in linear time},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)},
     year = {2010},
     doi = {10.46298/dmtcs.2802},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2802/}
}
TY  - JOUR
AU  - Feige, Uriel
AU  - Ron, Dorit
TI  - Finding hidden cliques in linear time
JO  - Discrete mathematics & theoretical computer science
PY  - 2010
VL  - DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2802/
DO  - 10.46298/dmtcs.2802
LA  - en
ID  - DMTCS_2010_special_258_a38
ER  - 
%0 Journal Article
%A Feige, Uriel
%A Ron, Dorit
%T Finding hidden cliques in linear time
%J Discrete mathematics & theoretical computer science
%D 2010
%V DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2802/
%R 10.46298/dmtcs.2802
%G en
%F DMTCS_2010_special_258_a38
Feige, Uriel; Ron, Dorit. Finding hidden cliques in linear time. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10) (2010). doi : 10.46298/dmtcs.2802. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2802/

Cité par Sources :