DBScholar

Back to papers

Diversified Top-k Graph Pattern Matching

Summary: Recasts simulation-based graph pattern matching as top-k retrieval for a designated output node, avoiding full match enumeration via early-terminating relevance-ranked algorithms. For diversified ranking, proves NP-completeness and provides a guaranteed approximation and early-terminating heuristic. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
10828
Venue
VLDB
Year
2013
Pagerank
7.0262215e-05
Overall Rank
3,908 | 73.19%
DOI
10.14778/2536258.2536263

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{fan_vldb13,
        title = {{Diversified Top-k Graph Pattern Matching}},
        author = {Fan, Wenfei and Wang, Xin and Wu, Yinghui},
        journal = {PVLDB},
        series = {{VLDB} '13},
        volume = {6},
        number = {13},
        pages = {1510--1521},
        doi = {10.14778/2536258.2536263},
        url = {https://doi.org/10.14778/2536258.2536263},
        year = {2013}
}

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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