-free graphs via shrinking the space of connecting subgraphs.
Marcin PilipczukMichal PilipczukPawel RzazewskiPublished in: CoRR (2020)
Keyphrases
- graph mining
- graph databases
- subgraph isomorphism
- graph matching
- subgraph matching
- frequent subgraph mining
- data structure
- low dimensional
- maximum common subgraph
- space time
- graph properties
- graph data
- frequent subgraphs
- graph structures
- directed graph
- vector space
- graph patterns
- maximal cliques
- graph representation
- undirected graph
- quasi cliques
- search space