Skip to content

Author

Adithya Diddapur

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Deterministic Streaming Lower Bounds for Approximate Maximum Clique and Maximum Independent Set

We study the canonical \textsf{Maximum Clique} and \textsf{Maximum Independent Set} problems in the one-pass edge-arrival graph streaming setting. Here, the edges of some input graph $G = (V,E)$ are presented one at a time (possibly including deletions), before an algorithm needs to produce either a large clique or ind...

Adithya Diddapur · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.