Finding cliques using few probes
Name
1809.06950.pdf
Description
Submitted version
Size
179.46 KB
Format
Adobe PDF
Checksum (MD5)
081768ef37455b62d848520652568f87
Author(s)
Feige, Uriel
Gamarnik, David
Neeman, Joe
Rácz, Miklós Z
Tetali, Prasad
Date Issued
2020
Journal
Random Structures and Algorithms
Publisher
Wiley
Version
Original manuscript
Abstract
© 2019 Wiley Periodicals, Inc. Consider algorithms with unbounded computation time that probe the entries of the adjacency matrix of an n vertex graph, and need to output a clique. We show that if the input graph is drawn at random from (Formula presented.) (and hence is likely to have a clique of size roughly (Formula presented.)), then for every δ<2 and constant ℓ, there is an α<2 (that may depend on δ and ℓ) such that no algorithm that makes nδ probes in ℓ rounds is likely (over the choice of the random graph) to output a clique of size larger than (Formula presented.).
MIT Department
Sloan School of Management
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1002/RSA.20896
