-free graphs with no large complete bipartite subgraphs.
Marthe BonamyNicolas BousquetMichal PilipczukPawel RzazewskiStéphan ThomasséBartosz WalczakPublished in: J. Comb. Theory, Ser. B (2022)
Keyphrases
- graph model
- bipartite graph
- graph mining
- subgraph matching
- subgraph isomorphism
- labeled graphs
- graph databases
- graph partitioning
- graph structures
- graph properties
- maximal cliques
- subgraph mining
- real valued
- reachability queries
- frequent subgraph mining
- data mining
- graph matching
- maximum clique
- graph theoretic
- graph data
- query graph
- connected subgraphs
- graph clustering
- dense subgraphs
- topological information
- maximum common subgraph
- frequent subgraphs
- graph patterns
- undirected graph
- graph structure
- directed graph
- data structure
- graph kernels
- complex structures
- spanning tree
- weighted graph
- graph theory
- link prediction
- quasi cliques