Partitioning of a graph into induced subgraphs not containing prescribed cliques.
Yaser RowshanAli TaherkhaniPublished in: Discret. Appl. Math. (2024)
Keyphrases
- maximum clique
- maximal cliques
- graph structure
- graph mining
- graph properties
- graph databases
- weighted graph
- graph partitioning
- graph theory
- graph structures
- graph theoretic
- branch and bound algorithm
- partitioning algorithm
- association graph
- subgraph mining
- graph data
- labeled graphs
- subgraph isomorphism
- graph patterns
- dense subgraphs
- query graph
- connected subgraphs
- functional modules
- data structure
- graph model
- graph representation
- spectral graph
- frequent subgraph mining
- bipartite graph
- vertex set
- quasi cliques
- reachability queries
- complex networks
- directed acyclic graph
- spanning tree
- graph matching
- relational data
- directed graph
- connected components
- topological information
- frequent subgraphs
- structured data
- random walk
- image segmentation
- graph search