Diversified Top-k Subgraph Querying in a Large Graph
SIGMOD/PODS'16: International Conference on Management of Data San Francisco California USA June, 2016, pp. 1167-1182, 2016.
Subgraph querying in a large data graph is interesting for different applications. A recent study shows that top-k diversified results are useful since the number of matching subgraphs can be very large. In this work, we study the problem of top-k diversified subgraph querying that asks for a set of up to k subgraphs isomorphic to a given...More
PPT (Upload PPT)