On Decomposing Graphs of Large Minimum Degree into Locally Irregular Subgraphs.
Jakub PrzybyloPublished in: Electron. J. Comb. (2016)
Keyphrases
- graph mining
- graph databases
- subgraph matching
- graph properties
- subgraph isomorphism
- labeled graphs
- subgraph mining
- maximum common subgraph
- graph structures
- connected subgraphs
- reachability queries
- spanning tree
- frequent subgraph mining
- dense subgraphs
- frequent subgraphs
- random graphs
- graph data
- graph theoretic
- maximum clique
- topological information
- graph theory
- minimum cost
- maximal cliques
- graph matching
- irregularly shaped
- weighted graph
- query graph
- directed graph
- data structure
- connected dominating set
- quasi cliques
- degree distribution
- graph patterns
- graph clustering
- graph model
- approximation algorithms
- pattern mining
- complex networks
- xml documents