Graphs without proper subgraphs of minimum degree 3 and short cycles.
Lothar NarinsAlexey PokrovskiyTibor SzabóPublished in: Comb. (2017)
Keyphrases
- graph mining
- graph databases
- subgraph isomorphism
- labeled graphs
- subgraph matching
- graph properties
- maximum clique
- connected subgraphs
- maximum common subgraph
- reachability queries
- subgraph mining
- graph structures
- spanning tree
- graph patterns
- random graphs
- graph data
- data structure
- frequent subgraphs
- frequent subgraph mining
- graph theoretic
- dense subgraphs
- graph theory
- query graph
- quasi cliques
- connected dominating set
- topological information
- graph kernels
- bipartite graph
- graph matching
- directed graph
- pattern mining
- maximal cliques
- degree distribution
- graph search
- graph model
- graph structure
- similarity function
- data objects
- connected components
- structured data
- query language