Colorful subgraphs in Kneser-like graphs.
Gábor SimonyiGábor TardosPublished in: Eur. J. Comb. (2007)
Keyphrases
- language model
- graph mining
- graph databases
- subgraph isomorphism
- subgraph matching
- labeled graphs
- graph properties
- graph structures
- connected subgraphs
- reachability queries
- graph data
- graph model
- frequent subgraph mining
- query graph
- maximum clique
- subgraph mining
- maximum common subgraph
- probabilistic model
- data structure
- frequent subgraphs
- graph matching
- graph patterns
- topological information
- dense subgraphs
- information retrieval
- maximal cliques
- graph theoretic
- graph theory
- graph representation
- graph structure
- directed graph
- pattern mining
- graph clustering
- small world
- mining algorithm
- similarity function
- data mining