A survey of algorithms for dense subgraph discovery is presented in this paper. The problem of dense subgraph discovery is closely related to clustering though the two problems also have a number of differences. For example, the problem of clusterin
The exponential number of possible subgraphs makes the problem of frequent subgraph mining a challenge. The set of maximal frequent subgraphs is much smaller to that of the set of frequent subgraphs, thus providing ample scope for pruning. MARGIN is
Subgraph search is the problem of searching a data graph for the occurrences of another graph, typically referred to as the query or pattern graph. This thesis is dedicated to studying a specific class of subgraph search, named subgraph isomorphism
