Tejasvam Singh

Learn More
Halldórsson, Sun, Szegedy, and Wang (ICALP 2012) [16] investigated the space complexity of the following problem CLIQUE-GAP(r, s): given a graph stream G, distinguish whether ω(G) ≥ r or ω(G) ≤ s, where ω(G) is the clique-number of G. In particular, they give matching upper and lower bounds for CLIQUE-GAP(r, s) for any r and s = c log(n), for some constant(More)
  • 1