A Sublinear-Time Randomized Parallel Algorithm for the Maximum Clique Problem in Perfect Graphs.

Farid Alizadeh

Browse the full SODA paper archive.