Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ITCS.2018.38
URN: urn:nbn:de:0030-drops-83552
URL: https://drops.dagstuhl.de/opus/volltexte/2018/8355/
Beame, Paul ; Har-Peled, Sariel ; Natarajan Ramamoorthy, Sivaramakrishnan ; Rashtchian, Cyrus ; Sinha, Makrand
Edge Estimation with Independent Set Oracles
| pdf-format: |
|
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 n^{2/3} polylog(n) independent set queries.
BibTeX - Entry
@InProceedings{beame_et_al:LIPIcs:2018:8355,
author = {Paul Beame and Sariel Har-Peled and Sivaramakrishnan Natarajan Ramamoorthy and Cyrus Rashtchian and Makrand Sinha},
title = {{Edge Estimation with Independent Set Oracles}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {38:1--38:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Anna R. Karlin},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8355},
URN = {urn:nbn:de:0030-drops-83552},
doi = {10.4230/LIPIcs.ITCS.2018.38},
annote = {Keywords: Approximate Counting, Independent Set Queries, Sparsification, Importance Sampling}
}
| Keywords: | Approximate Counting, Independent Set Queries, Sparsification, Importance Sampling | |
| Seminar: | 9th Innovations in Theoretical Computer Science Conference (ITCS 2018) | |
| Issue date: | 2018 | |
| Date of publication: | 12.01.2018 |
