Name
Abstract | ||
|---|---|---|
AbstractWe 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. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1145/3404867 | ACM Transactions on Algorithms |
Keywords | DocType | Volume |
Independent set queries, graph parameter estimation | Journal | 16 |
Issue | ISSN | Citations |
4 | 1549-6325 | 1 |
PageRank | References | Authors |
0.35 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paul Beame | 1 | 2234 | 176.07 |
| Sariel Har-Peled | 2 | 2630 | 191.68 |
| Sivaramakrishnan Natarajan Ramamoorthy | 3 | 9 | 2.92 |
| Cyrus Rashtchian | 4 | 496 | 31.18 |
| Makrand Sinha | 5 | 12 | 3.67 |