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.

Cited by: 28|Bibtex|Views55|DOI:https://doi.org/10.1145/2882903.2915216
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|dl.acm.org

Abstract:

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

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments