@inproceedings{27ef970d08134486905b41eab68e91a3,
title = "Edge estimation with independent set oracles",
abstract = "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 n2/3 · polylog(n) independent set queries.",
keywords = "Approximate Counting, Importance Sampling, Independent Set Queries, Sparsification",
author = "Paul Beame and Sariel Har-Peled and Sivaramakrishnan NatarajanRamamoorthy and Cyrus Rashtchian and Makrand Sinha",
note = "Funding Information: A full version of the paper is available at [2], https://arxiv.org/abs/1711.07567 † Supported in part by the NSF under agreement CCF-1524246. ‡ Supported in part by NSF AF awards CCF-1421231 and CCF-1217462. Work done while visiting University of Washington on Sabbatical in 2017. § Supported by the NSF under agreements CCF-1149637, CCF-1420268 and CCF-1524251. ¶ Work partially completed while the author was at Microsoft Research. Publisher Copyright: {\textcopyright} Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy.; 9th Innovations in Theoretical Computer Science, ITCS 2018 ; Conference date: 11-01-2018 Through 14-01-2018",
year = "2018",
month = jan,
day = "1",
doi = "10.4230/LIPIcs.ITCS.2018.38",
language = "English (US)",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Karlin, {Anna R.}",
booktitle = "9th Innovations in Theoretical Computer Science, ITCS 2018",
}