"Finding a large hidden clique in a random graph."

Noga Alon, Michael Krivelevich, Benny Sudakov (1998)

> Home

Details and statistics

DOI: 10.1002/(SICI)1098-2418(199810/12)13:3/4<457::AID-RSA14>3.0.CO;2-W

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/AlonKS98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/AlonKS98
Noga Alon, Michael Krivelevich, Benny Sudakov:
Finding a large hidden clique in a random graph. Random Struct. Algorithms 13(3-4): 457-466 (1998)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.