Sciweavers

ICDM
2007
IEEE

Subgraph Support in a Single Large Graph

13 years 10 months ago
Subgraph Support in a Single Large Graph
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. However, if the input is one large graph, an appropriate support definition is much more difficult to find. In this paper we study the core problem, namely overlapping embeddings of the subgraph, in detail and suggest a definition that relies on the non-existence of equivalent ancestor embeddings in order to guarantee that the resulting support is anti-monotone. We prove this property and describe a method to compute the support defined in this way.
Mathias Fiedler, Christian Borgelt
Added 03 Jun 2010
Updated 03 Jun 2010
Type Conference
Year 2007
Where ICDM
Authors Mathias Fiedler, Christian Borgelt
Comments (0)