Finding Maximum Degrees in Hidden Bipartite Graphs
Summary: Adaptive, instance-optimal algorithm for finding the k highest-degree vertices in B of a hidden bipartite graph via edge-probing queries. Provides a tight constant-factor guarantee (≤2) within a broad solution class and shows practical query reductions (often near km+n). (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yufei Tao
- 2. Cheng Sheng
- 3. Jianzhong Li
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8 | Optimal Aggregation Algorithms for Middleware [Extended Abstract] | 2001 | PODS | 0.0015436578 |
| 551 | Supporting Incremental Join Queries on Ranked Inputs | 2001 | VLDB | 0.00020310856 |
| 673 | Supporting Top-k Join Queries in Relational Databases | 2003 | VLDB | 0.00018325667 |
| 696 | Exact Indexing of Dynamic Time Warping | 2002 | VLDB | 0.00017991162 |
| 913 | Finding k-Dominant Skylines in High Dimensional Space | 2006 | SIGMOD | 0.00015372758 |
| 2,965 | Evaluating Rank Joins with Optimal Cost | 2008 | PODS | 7.8049517e-05 |
Previous
Page 1 / 1
Next