205 search results - page 7 / 41 » Pruning 2-Connected Graphs |
374
Voted
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
A novel approach for event summarization and rare event detection is proposed. Unlike conventional methods that deal with event summarization and rare event detection independently...
214
Voted
ICDE
2006
IEEE
16 years 2 months ago
2006
IEEE
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
112
Voted
EDBT
2009
ACM
15 years 7 months 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...
103
Voted
EDBT
2008
ACM
16 years 29 days 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...
116
Voted
GC
2007
Springer
15 years 23 days ago
2007
Springer
For an integer k > 0, a graph G is k-triangular if every edge of G lies in at least k distinct 3-cycles of G. In (J Graph Theory 11:399–407 (1987)), Broersma and Veldman propo...