DBScholar

Back to papers

Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases

Summary: Targets subgraph similarity search in large probabilistic graphs with correlated edge occurrences, proving the problem #P-complete. A PMI-based filter derives tight probability bounds for pruning, followed by efficient sampling-based verification. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
10709
Venue
VLDB
Year
2012
Pagerank
7.3214417e-05
Overall Rank
3,548 | 75.66%
DOI
10.14778/2311906.2311908

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{yuan_vldb12,
        title = {{Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases}},
        author = {Yuan, Ye and Wang, Guoren and Chen, Lei and Wang, Haixun},
        journal = {PVLDB},
        series = {{VLDB} '12},
        volume = {5},
        number = {9},
        pages = {800--811},
        doi = {10.14778/2311906.2311908},
        url = {https://doi.org/10.14778/2311906.2311908},
        year = {2012}
}

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 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