Yash Khanna

activity

20202026

collaborators

Showing 2020Show all

2 papers · 1 filter

cs.DS2020

Exact recovery of planted cliques in semi-random graphs

Yash Khanna

In this paper, we study the Planted Clique problem in a semi-random model. Our model is inspired from the Feige-Kilian model [16] which has been studied in many other works [8,11,1…

cs.DS2020

Planted Models for the Densest $k$ -Subgraph Problem

Yash Khanna, Anand Louis

Given an undirected graph $G$ , the Densest $k$ -subgraph problem (DkS) asks to compute a set $S \subset V$ of cardinality $∣ S ∣ \leq k$ such that the weight of…

Exact recovery of planted cliques in semi-random graphs

Planted Models for the Densest k-Subgraph Problem

Planted Models for the Densest $k$ -Subgraph Problem