Local Density In Graphs With Forbidden Subgraphs.
Peter KeevashBenny SudakovPublished in: Comb. Probab. Comput. (2003)
Keyphrases
- graph mining
- graph databases
- subgraph isomorphism
- labeled graphs
- subgraph matching
- graph properties
- reachability queries
- subgraph mining
- maximum common subgraph
- graph structures
- connected subgraphs
- graph data
- maximum clique
- topological information
- frequent subgraph mining
- frequent subgraphs
- query graph
- graph patterns
- data structure
- low density
- graph matching
- quasi cliques
- dense subgraphs
- directed graph
- graph model
- random graphs
- maximal cliques
- graph clustering
- graph theoretic
- graph theory
- graph search
- small world
- biological networks
- graph representation
- graph partitioning
- graph structure
- link prediction
- connected components
- random walk
- d objects
- pairwise