Finding cliques using few probes

RANDOM STRUCTURES & ALGORITHMS, pp. 142.0-153.0, 2020.

Cited by: 0|Views36
EI

Abstract:

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 Gn,12 (and hence is likely to have a clique of size roughly 2logn), then for every delta l, there is an alpha<2 (that may depend on de...More

Code:

Data:

Get fulltext within 24h
Bibtex
Upload PDF

1.Your uploaded documents will be check within 24h, and coins will be credited to your account.

2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.

3.10 coins will be exchanged for 1 yuan.

?

Upload a single paper

for 5 coins

Wechat's Red Packet
?

Upload 50 articles

for 250 coins

Wechat's Red Packet
?

Upload 200 articles

for 1000 coins

Wechat's Red Packet
?

Upload 500 articles

for 2500 coins

Wechat's Red Packet
?

Upload 1000 articles

for 5000 coins

Wechat's Red Packet
Your rating :
0

 

Tags
Comments