TY - JOUR
T1 - Edge Estimation with Independent Set Oracles
AU - Beame, Paul
AU - Har-Peled, Sariel
AU - Ramamoorthy, S. N.
AU - Rashtchian, Cyrus
AU - Sinha, Makrand
N1 - A preliminary version of this article appeared in the proceedings of ITCS 2018 [7]. This work was done while S. Har-Peled was visiting the University of Washington on a sabbatical in 2017. The work was partially completed while C. Rashtchian was a graduate student at the Paul G. Allen School of CSE, University of Washington, Seattle, and while at Microsoft Research. During the course of this work, M. Sinha was a graduate student at the Paul G. Allen School of CSE, University of Washington, Seattle. P. Beame was supported in part by NSF grant CCF-1524246. S. Har-Peled was supported in part by NSF AF awards CCF-1421231 and CCF-1217462. S. N. Ramamoorthy was supported by the NSF under agreements CCF-1149637, CCF-1420268, and CCF-1524251. M. Sinha was supported by the NSF under agreements CCF-1149637, CCF-1420268, and CCF-1524251. Authors\u2019 addresses: P. Beame, Paul G. Allen School of CSE, University of Washington, Paul G. Allen Center, Box 352350,185 E Stevens Way NE, Seattle, WA 98195-2350, USA; email: [email protected]; S. Har-Peled, Department of Computer Science, University of Illinois, 201 N. Goodwin Avenue, Urbana, IL 61801-2302, USA; email: [email protected]; S. N. Ramamoorthy, Paul G. Allen School of CSE, University of Washington, 5215 15th Ave NE, Apt 7, Seattle, WA 98105, USA; email: [email protected]; C. Rashtchian, Department of Computer Science and Engineering, University of California, San Diego, 9500 Gilman Drive, La Jolla, CA 92093-0404, USA; email: [email protected]; M. Sinha, Centrum Wiskunde & Informatika, Science Park 123, 1098 XG Amsterdam, Netherlands; email: [email protected]. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]. \u00A9 2020 Association for Computing Machinery. 1549-6325/2020/09-ART52 $15.00 https://doi.org/10.1145/3404867
PY - 2020/9
Y1 - 2020/9
N2 - We study the task of estimating the number of edges in a graph, where the access to the graph is provided via 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, using (i) polylog(n) bipartite independent set queries or (ii) n2/3 polylog(n) independent set queries.
AB - We study the task of estimating the number of edges in a graph, where the access to the graph is provided via 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, using (i) polylog(n) bipartite independent set queries or (ii) n2/3 polylog(n) independent set queries.
KW - Independent set queries
KW - graph parameter estimation
UR - https://www.scopus.com/pages/publications/85092559148
UR - https://www.scopus.com/pages/publications/85092559148#tab=citedBy
U2 - 10.1145/3404867
DO - 10.1145/3404867
M3 - Article
AN - SCOPUS:85092559148
SN - 1549-6325
VL - 16
JO - ACM Transactions on Algorithms
JF - ACM Transactions on Algorithms
IS - 4
M1 - 3404867
ER -