Graphs without large triangle free subgraphs.
Béla BollobásH. R. HindPublished in: Discret. Math. (1991)
Keyphrases
- graph mining
- graph databases
- subgraph isomorphism
- subgraph matching
- graph properties
- labeled graphs
- reachability queries
- graph data
- subgraph mining
- graph structures
- connected subgraphs
- maximum clique
- maximum common subgraph
- graph matching
- graph patterns
- frequent subgraph mining
- pattern mining
- frequent subgraphs
- graph theoretic
- graph model
- topological information
- graph structure
- dense subgraphs
- query graph
- data structure
- graph theory
- directed graph
- graph representation
- quasi cliques
- random graphs
- graph kernels
- biological networks
- complex structures
- undirected graph
- relational data
- connected components
- application domains
- query language