Long Paths and Cycles in Random Subgraphs of $\mathcal{H}$-free Graphs.
Michael KrivelevichWojciech SamotijPublished in: Electron. J. Comb. (2014)
Keyphrases
- graph databases
- graph mining
- subgraph isomorphism
- graph structures
- graph properties
- labeled graphs
- subgraph matching
- subgraph mining
- maximum common subgraph
- connected subgraphs
- reachability queries
- graph data
- maximum clique
- graph patterns
- transitive closure of roles
- graph theoretic
- graph theory
- graph model
- shortest path
- quasi cliques
- topological information
- directed graph
- frequent subgraph mining
- graph matching
- dense subgraphs
- query graph
- optimal path
- bipartite graph
- structured data
- connected components
- similarity function
- link prediction
- link analysis
- graph clustering
- biological networks
- graph search