Covering of r-Graphs by Complete r-Partite Subgraphs.
Paul ErdösVojtech RödlPublished in: Random Struct. Algorithms (1995)
Keyphrases
- graph databases
- graph mining
- graph structure
- labeled graphs
- graph properties
- subgraph matching
- subgraph isomorphism
- graph structures
- reachability queries
- data structure
- connected subgraphs
- maximum common subgraph
- subgraph mining
- graph data
- frequent subgraph mining
- graph theoretic
- bipartite graph
- dense subgraphs
- graph matching
- frequent subgraphs
- maximal cliques
- graph clustering
- query graph
- maximum clique
- spanning tree
- structural information
- real world