BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification
Summary: BICE compresses the subgraph-search space by combining bipartite-matching pruning, failing-sets augmented with bipartite matching, and a novel cell-wide verification to avoid unnecessary candidate expansions. Combined algorithm yields up to ~100× speedups versus state-of-the-art baselines. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yunyoung Choi (Alsemy)
- 2. Kunsoo Park (Seoul National University)
- 3. Hyunjoon Kim (Hanyang University)
BibTeX Citation
@article{choi_vldb23,
title = {{BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification}},
author = {Choi, Yunyoung and Park, Kunsoo and Kim, Hyunjoon},
journal = {PVLDB},
series = {{VLDB} '23},
volume = {16},
number = {9},
pages = {2186--2198},
doi = {10.14778/3598581.3598591},
url = {https://doi.org/10.14778/3598581.3598591},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 23 of 23 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next