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 (Chinese University of Hong Kong)
- 2. Cheng Sheng (Chinese University of Hong Kong)
- 3. Jianzhong Li (Harbin Engineering University)
BibTeX Citation
@inproceedings{tao_sigmod10,
title = {{Finding Maximum Degrees in Hidden Bipartite Graphs}},
author = {Tao, Yufei and Sheng, Cheng and Li, Jianzhong},
series = {{SIGMOD} '10},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/1807167.1807263},
url = {https://dl.acm.org/doi/10.1145/1807167.1807263},
year = {2010}
}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 |
|---|---|---|---|---|
| 5 | Optimal Aggregation Algorithms for Middleware [Extended Abstract] | 2001 | PODS | 0.0010688884 |
| 505 | Supporting Top-k Join Queries in Relational Databases | 2003 | VLDB | 0.00017162373 |
| 511 | Supporting Incremental Join Queries on Ranked Inputs | 2001 | VLDB | 0.00017061618 |
| 616 | Exact Indexing of Dynamic Time Warping | 2002 | VLDB | 0.00015512487 |
| 820 | Finding k-Dominant Skylines in High Dimensional Space | 2006 | SIGMOD | 0.00013621724 |
| 2,625 | Evaluating Rank Joins with Optimal Cost | 2008 | PODS | 8.1948138e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,057 | Efficient Bi-triangle Counting for Large Bipartite Networks | 2021 | VLDB |
| 2 | 1,603 | Adopting Worst-Case Optimal Joins in Relational Database Systems | 2020 | VLDB |
| 3 | 318 | Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems | 2018 | PODS |
| 4 | 4,567 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |
| 5 | 10,671 | Theoretically and Practically Efficient Maximum Biclique Search | 2026 | SIGMOD |
| 6 | 2,754 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB |
| 7 | 7,637 | Processing Top-k Join Queries | 2010 | VLDB |
| 8 | 706 | Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins | 2019 | VLDB |
| 9 | 5,486 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD |
| 10 | 10,930 | Maximum Defective Biclique Search in Large Bipartite Graphs | 2026 | VLDB |