Embedding spanning subgraphs in uniformly dense and inseparable graphs.
Oliver EbsenGiulia S. MaesakaChristian ReiherMathias SchachtBjarne SchülkePublished in: Random Struct. Algorithms (2020)
Keyphrases
- quasi cliques
- graph mining
- graph databases
- labeled graphs
- subgraph isomorphism
- subgraph matching
- graph embedding
- graph structures
- frequently occurring
- graph properties
- graph data
- connected subgraphs
- frequent subgraph mining
- subgraph mining
- reachability queries
- frequent subgraphs
- graph patterns
- maximum common subgraph
- graph matching
- maximum clique
- graph theory
- dense subgraphs
- biological networks
- topological information
- data structure
- graph theoretic
- graph model
- link prediction
- graph clustering
- vector space
- structured data
- maximal cliques
- community discovery
- bipartite graph
- query graph
- mining algorithm
- densely connected
- directed graph
- pattern mining
- graph kernels