On the maximum q-colourable induced subgraph problem in perfect graphs.
Nicola ApollonioMassimiliano CaramiaPublished in: Int. J. Math. Oper. Res. (2010)
Keyphrases
- graph mining
- graph databases
- subgraph matching
- subgraph isomorphism
- graph properties
- graph classification
- labeled graphs
- graph data
- frequent subgraph mining
- frequent subgraphs
- dense subgraphs
- connected subgraphs
- graph theory
- query graph
- directed graph
- connected components
- subgraph mining
- graph matching
- graph theoretic
- series parallel
- maximum clique
- graph structures
- maximum common subgraph
- maximum number
- knn
- np hard
- graph construction
- graph patterns
- complex structures
- weighted graph
- bipartite graph
- similarity function
- pattern mining
- application domains
- search space