Embedding spanning bounded degree subgraphs in randomly perturbed graphs.
Julia BöttcherRichard MontgomeryOlaf ParczykYury PersonPublished in: Electron. Notes Discret. Math. (2017)
Keyphrases
- bounded degree
- graph theoretic
- graph mining
- graph properties
- graph databases
- subgraph matching
- subgraph isomorphism
- graph structures
- labeled graphs
- graph embedding
- bounded treewidth
- reachability queries
- graph data
- maximum clique
- subgraph mining
- connected subgraphs
- maximum common subgraph
- frequent subgraphs
- query graph
- frequent subgraph mining
- graph matching
- vector space
- topological information
- graph patterns
- graph theory
- database
- pattern mining
- np complete
- query language
- data structure
- database systems