Solving the clique cover problem on (bull, C4)-free graphs.
Kathie CameronChính T. HoàngPublished in: Discret. Appl. Math. (2019)
Keyphrases
- maximum clique
- real time
- graph matching
- graph properties
- series parallel
- combinatorial optimization
- graph structure
- graph mining
- quasi cliques
- graph clustering
- graph theoretic
- graph representation
- complex structures
- graph theory
- directed graph
- graph cuts
- evolutionary algorithm
- pattern recognition
- reinforcement learning
- data sets