Fixed finite subgraph theorems in infinite weakly modular graphs.
Norbert PolatPublished in: Discret. Math. (2004)
Keyphrases
- graph mining
- graph databases
- subgraph isomorphism
- graph classification
- subgraph matching
- graph data
- finite sets
- labeled graphs
- graph properties
- dense subgraphs
- connected subgraphs
- frequent subgraph mining
- graph matching
- frequent subgraphs
- query graph
- real numbers
- graph kernels
- maximum clique
- finite number
- graph patterns
- graph theoretic
- graph model
- weighted graph
- maximum common subgraph
- linearly separable
- relational data
- modular structure
- finite dimensional
- spanning tree