Unavoidable subgraphs of colored graphs.
Jonathan CutlerBalázs MontághPublished in: Discret. Math. (2008)
Keyphrases
- graph mining
- graph databases
- subgraph isomorphism
- subgraph matching
- graph properties
- labeled graphs
- connected subgraphs
- graph data
- reachability queries
- graph structures
- subgraph mining
- graph theory
- frequent subgraph mining
- maximum common subgraph
- topological information
- maximal cliques
- graph theoretic
- maximum clique
- graph matching
- graph patterns
- graph representation
- query graph
- dense subgraphs
- graph model
- data structure
- graph clustering
- bipartite graph
- connected components
- d objects
- quasi cliques
- neural network