eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2018-01-12
38:1
38:21
10.4230/LIPIcs.ITCS.2018.38
article
Edge Estimation with Independent Set Oracles
Beame, Paul
Har-Peled, Sariel
Natarajan Ramamoorthy, Sivaramakrishnan
Rashtchian, Cyrus
Sinha, Makrand
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 n-vertex graph: one that uses only polylog(n) bipartite independent set queries, and another one that uses n^{2/3} polylog(n) independent set queries.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol094-itcs2018/LIPIcs.ITCS.2018.38/LIPIcs.ITCS.2018.38.pdf
Approximate Counting
Independent Set Queries
Sparsification
Importance Sampling