Edge Estimation with Independent Set Oracles-Reference-Cited by-同舟云学术

Edge Estimation with Independent Set Oracles

Published:2020-10-31 Issue:4 Volume:16 Page:1-27
ISSN:1549-6325
Container-title:ACM Transactions on Algorithms
language:en
Short-container-title:ACM Trans. Algorithms

Author:

Beame Paul¹,Har-Peled Sariel²,Ramamoorthy Sivaramakrishnan Natarajan¹,Rashtchian Cyrus³^ORCID,Sinha Makrand⁴

Affiliation:

1. University of Washington, Seattle, WA, USA

2. University of Illinois, Urbana–Champaign, USA

3. University of California, San Diego, CA, USA

4. Centrum Wiskunde 8 Informatika, Netherlands

Abstract

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) n 2/3 polylog( n ) independent set queries.

Funder

NSF AF

NSF

Publisher

Association for Computing Machinery (ACM)

Subject

Mathematics (miscellaneous)

Link

https://dl.acm.org/doi/pdf/10.1145/3404867

Reference36 articles.

1. Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling

2. Learning a Hidden Subgraph

3. Learning a Hidden Matching

4. Learning a hidden graph using O(logn) queries per edge

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Faster Counting and Sampling Algorithms using Colorful Decision Oracle;ACM Transactions on Computation Theory;2024-06-10

2. Almost optimal query algorithm for hitting set using a subset query;Journal of Computer and System Sciences;2023-11

3. Cut Query Algorithms with Star Contraction;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10

4. Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle;SIAM Journal on Computing;2022-07-05

5. Algorithms that Access the Input via Queries;SOFSEM 2021: Theory and Practice of Computer Science;2021