An algorithm for the decomposition of graphs into cliques.
Xiang-Ying SuPublished in: J. Graph Theory (1995)
Keyphrases
- learning algorithm
- detection algorithm
- graph structure
- experimental evaluation
- cost function
- optimization algorithm
- computational cost
- objective function
- maximum clique
- decomposition algorithm
- k means
- dynamic programming
- optimal solution
- tree structure
- search space
- computational complexity
- neural network
- decomposition method
- weighted graph
- similarity measure
- matching algorithm
- high accuracy
- polynomial time complexity
- graph theory
- times faster
- segmentation algorithm
- linear programming
- evolutionary algorithm
- preprocessing
- genetic algorithm