2026-07-21T18:48:30Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:8355 2024-03-06T10:42:07Z ddc:004 open_access

Edge Estimation with Independent Set Oracles Beame, Paul Har-Peled, Sariel Natarajan Ramamoorthy, Sivaramakrishnan Rashtchian, Cyrus Sinha, Makrand Approximate Counting Independent Set Queries Sparsification Importance Sampling 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Paul Beame and Sariel Har-Peled and Sivaramakrishnan Natarajan Ramamoorthy and Cyrus Rashtchian and Makrand Sinha 2018 Is Part Of LIPIcs, Volume 94, 9th Innovations in Theoretical Computer Science Conference (ITCS 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ITCS.2018.38 urn:nbn:de:0030-drops-83552 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.38 eng https://creativecommons.org/licenses/by/3.0/legalcode