Sparse induced subgraphs in P_6-free graphs.
Maria ChudnovskyRose McCartyMarcin PilipczukMichal PilipczukPawel RzazewskiPublished in: CoRR (2023)
Keyphrases
- graph mining
- graph databases
- subgraph isomorphism
- graph properties
- subgraph matching
- labeled graphs
- connected subgraphs
- reachability queries
- maximum common subgraph
- graph structures
- subgraph mining
- frequent subgraph mining
- graph data
- maximum clique
- sparse data
- graph patterns
- query graph
- frequent subgraphs
- topological information
- dense subgraphs
- graph theoretic
- graph theory
- graph matching
- directed acyclic
- graph model
- sparse representation
- quasi cliques
- gaussian graphical models
- directed graph
- maximal cliques
- data structure
- graph structure
- relational data
- structured data
- graph kernels
- regular expressions
- high dimensional