Regular graphs whose subgraphs tend to be acyclic.
Noga AlonEitan BachmatPublished in: Random Struct. Algorithms (2006)
Keyphrases
- graph mining
- graph databases
- subgraph isomorphism
- subgraph matching
- graph properties
- reachability queries
- connected subgraphs
- labeled graphs
- graph structures
- graph data
- maximum common subgraph
- frequent subgraphs
- subgraph mining
- frequent subgraph mining
- maximum clique
- connected graphs
- query graph
- dense subgraphs
- graph matching
- quasi cliques
- graph patterns
- np hard
- graph structure
- graph theoretic
- data structure
- np complete
- bounded treewidth
- mining algorithm
- database schemes
- maximal cliques
- pattern mining
- directed graph
- random graphs
- graph kernels
- spanning tree
- graph model
- weighted graph
- relational data
- data objects
- data model
- relational databases