Clique minors in graphs with a forbidden subgraph.
Matija BucicJacob FoxBenny SudakovPublished in: Random Struct. Algorithms (2022)
Keyphrases
- graph properties
- maximum clique
- maximum weight
- graph mining
- graph databases
- independent set
- quasi cliques
- graph theoretic
- subgraph matching
- graph classification
- graph theory
- labeled graphs
- graph data
- directed graph
- subgraph isomorphism
- weighted graph
- branch and bound algorithm
- bipartite graph
- frequent subgraph mining
- association graph
- dense subgraphs
- maximal cliques
- connected subgraphs
- graph model
- frequent subgraphs
- random walk
- subgraph mining
- lower bound
- maximal clique enumeration
- maximum independent set
- graph clustering
- directed acyclic graph
- graph cuts
- np hard