Finding a large hidden clique in a random graph

Noga Alon and Michael Krivelevich and Benny Sudakov

misc1998

Citation key: AlonKrivelevichSudakov1998
Year: 1998
Cited by: 1 catalog records
Direct source: Available

Reference note

Why this source is in the ledger

Noga Alon, Michael Krivelevich, and Benny Sudakov, “Finding a large hidden clique in a random graph,” Random Structures \& Algorithms 13 (1998), 457–466, DOI: 10.1002/(SICI)1098-2418(199810/12)13:3/4<457::AID-RSA14>3.0.CO;2-W.

Catalog connections

Conjectures citing this source

TCS-022Planted Clique ConjectureTheoretical computer science

Source record

Bibliographic fields

Inspect the parsed BibTeX fields

author: Noga Alon and Michael Krivelevich and Benny Sudakov
doi: 10.1002/(SICI)1098-2418(199810/12)13:3/4<457::AID-RSA14>3.0.CO;2-W
note: Noga Alon, Michael Krivelevich, and Benny Sudakov, “Finding a large hidden clique in a random graph,” Random Structures \& Algorithms 13 (1998), 457--466, DOI: 10.1002/(SICI)1098-2418(199810/12)13:3/4<457::AID-RSA14>3.0.CO;2-W.
title: Finding a large hidden clique in a random graph
year: 1998