DBScholar

Back to papers

Interactive Graph Search Made Simple

Summary: An algorithmic framework for Interactive Graph Search that reduces design to two black-box operations. Simple black-box instantiations yield optimal interaction rounds and substantially lower CPU time, with extensive real/synthetic validation. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h04b434a427c82c23
Venue
SIGMOD
Year
2025
Pagerank
5.163649e-05
Overall Rank
9,535 | 35.90%
DOI
10.1145/3725409

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{lu_sigmod25,
        title = {{Interactive Graph Search Made Simple}},
        author = {Lu, Shangqi and Wang, Ru and Tao, Yufei},
        series = {{SIGMOD} '25},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3725409},
        url = {https://dl.acm.org/doi/10.1145/3725409},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
787 Human-Assisted Graph Search: It’s Okay to Ask Questions 2011 VLDB 0.00013988274
5,570 Efficient Algorithms for Crowd-Aided Categorization 2020 VLDB 6.0811968e-05
6,629 Budget Constrained Interactive Search for Multiple Targets 2021 VLDB 5.7274363e-05
6,925 Interactive Graph Search 2019 SIGMOD 5.6423723e-05
8,252 Optimal Algorithms for Multiway Search on Partial Orders 2022 PODS 5.3685285e-05
Previous Page 1 / 1 Next

Semantically Similar Papers