Diversified Top-k Graph Pattern Matching

Summary: Top-k graph pattern matching with a designated output node, returning only k matches for uo. Delta_r (relevance) and delta_d (diversity) rankings; two early-termination top-k algorithms; diversified NP-hard variant with approximations; experiments show gains. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 10640
Venue: VLDB
Year: 2013
Pagerank: 5.9092289e-05
Overall Rank: 4,807 | 66.56%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 12 of 12 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,561	Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together	2019	SIGMOD	0.00011358946
4,614	Interactive Summarization and Exploration of Top Aggregate Query Answers	2018	VLDB	6.0467204e-05
5,854	Diversified Top-k Subgraph Querying in a Large Graph	2016	SIGMOD	5.3006473e-05
7,762	Optimal Enumeration: Efficient Top-k Tree Matching	2015	VLDB	4.6583829e-05
9,106	TED: Towards Discovering Top-k Edge-Diversified Patterns in a Graph Database	2023	SIGMOD	4.3952103e-05
9,727	MatCo: Computing Match Cover of Subgraph Query over Graph Data	2025	SIGMOD	4.2942813e-05
9,847	Discovering Top-k Relevant and Diversified Rules	2024	SIGMOD	4.2721228e-05
9,887	Graph Exploration: From Users to Large Graphs	2017	SIGMOD	4.2621158e-05
10,308	Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching	2026	VLDB	4.1945683e-05
10,851	Mix & Match: Subgraph Matching for Absolute Coverage	2025	VLDB	4.1945683e-05
11,559	Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees	2020	SIGMOD	4.1945683e-05
11,659	Answering Why-questions by Exemplars in Attributed Graphs	2019	SIGMOD	4.1945683e-05

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.

Rank	Cited Paper	Year	Venue	Pagerank
7	Optimal Aggregation Algorithms for Middleware [Extended Abstract]	2001	PODS	0.0015496097
73	XRANK: Ranked Keyword Search over XML Documents	2003	SIGMOD	0.00058443993
1,414	Graph Pattern Matching: From Intractable to Polynomial Time	2010	VLDB	0.00012118275
1,445	Diversifying Top-K Results	2012	VLDB	0.00011945231
1,725	Max-Sum Diversification, Monotone Submodular Functions and Dynamic Updates	2012	PODS	0.00010748322
1,837	Identifying Meaningful Return Information for XML Keyword Search	2007	SIGMOD	0.00010356716
4,143	Efficient Algorithms for Exact Ranked Twig-Pattern Matching over Graphs	2008	SIGMOD	6.4129418e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
4,143	Efficient Algorithms for Exact Ranked Twig-Pattern Matching over Graphs	2008	SIGMOD	6.4129418e-05
5,776	Capturing Topology in Graph Pattern Matching	2012	VLDB	5.3309758e-05
7,268	Top-K Structural Diversity Search in Large Networks	2013	VLDB	4.7817823e-05
1,720	Incremental Graph Pattern Matching	2011	SIGMOD	0.00010779343
11,559	Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees	2020	SIGMOD	4.1945683e-05
7,762	Optimal Enumeration: Efficient Top-k Tree Matching	2015	VLDB	4.6583829e-05
11,565	Simulation-based Approximate Graph Pattern Matching	2020	SIGMOD	4.1945683e-05
1,414	Graph Pattern Matching: From Intractable to Polynomial Time	2010	VLDB	0.00012118275
5,854	Diversified Top-k Subgraph Querying in a Large Graph	2016	SIGMOD	5.3006473e-05
10,308	Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching	2026	VLDB	4.1945683e-05