DBScholar

Back to papers

Efficient Subgraph Search over Large Uncertain Graphs

Summary: Studies threshold-based probabilistic subgraph search under possible-world semantics in large uncertain graph databases, proving the task #P-complete. Combines an optimally selected-feature probabilistic inverted index (PIndex) with exact and bound verification for practical search. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
10507
Venue
VLDB
Year
2011
Pagerank
6.4780097e-05
Overall Rank
4,853 | 66.71%
DOI
10.14778/1920841.1920952

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{yuan_vldb11,
        title = {{Efficient Subgraph Search over Large Uncertain Graphs}},
        author = {Yuan, Ye and Wang, Guoren and Wang, Haixun and Chen, Lei},
        journal = {PVLDB},
        series = {{VLDB} '11},
        volume = {3},
        number = {1},
        pages = {876--887},
        doi = {10.14778/1920841.1920952},
        url = {https://doi.org/10.14778/1920841.1920952},
        year = {2011}
}

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers