
Nearly optimal edge estimation with independent set queries
We study the problem of estimating the number of edges of an unknown, un...
read it

Hyperedge Estimation using Polylogarithmic Subset Queries
A hypergraph H is a set system (U( H), F(H)), where U( H) denotes the s...
read it

Distributed Computation of Topk Degrees in Hidden Bipartite Graphs
Hidden graphs are flexible abstractions that are composed of a set of kn...
read it

Bipartite Independent Set Oracles and Beyond: Can it Even Count Triangles in Polylogarithmic Queries?
Beame et al. [ITCS 2018] introduced and used the Bipartite Independent S...
read it

Strong HananiTutte for the Torus
If a graph can be drawn on the torus so that every two independent edges...
read it

Querying a Matrix through MatrixVector Products
We consider algorithms with access to an unknown matrix M∈F^n × d via ma...
read it

A New Algorithm for the Robust Semirandom Independent Set Problem
In this paper, we study a semirandom version of the planted independent...
read it
Edge Estimation with Independent Set Oracles
We study the problem of estimating the number of edges in a graph with access to only an independent set oracle. Independent set queries draw motivation from group testing and have applications to the complexity of decision versus counting problems. We give two algorithms to estimate the number of edges in an nvertex graph: one that uses only polylog(n) bipartite independent set queries, and another one that uses n^2/3·polylog(n) independent set queries.
READ FULL TEXT
Comments
There are no comments yet.