16 search results - page 2 / 4 » Pruning by Isomorphism in Branch-and-Cut |
EDBT
2008
ACM
14 years 5 months ago
2008
ACM
Retrieving related graphs containing a query graph from a large graph database is a key issue in many graph-based applications, such as drug discovery and structural pattern recog...
PVLDB
2010
13 years 3 months ago
2010
Graphs are of growing importance in modeling complex structures such as chemical compounds, proteins, images, and program dependence. Given a query graph Q, the subgraph isomorphi...
ICDM
2006
IEEE
13 years 11 months ago
2006
IEEE
The exponential number of possible subgraphs makes the problem of frequent subgraph mining a challenge. Maximal frequent mining has triggered much interest since the size of the s...
ANTS
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We show that a specific even unimodular lattice of dimension 80, first investigated by Schulze-Pillot and others, is extremal (i.e., the minimal nonzero norm is 8). Thi...
EDBT
2009
ACM
14 years 3 days ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...