A new approximate cluster deletion algorithm for diamond-free graphs.
Sabrine MalekWady NaanaaPublished in: J. Comb. Optim. (2020)
Keyphrases
- dynamic programming
- detection algorithm
- learning algorithm
- optimal solution
- np hard
- cost function
- data clustering
- preprocessing
- experimental evaluation
- segmentation algorithm
- clustering algorithm
- cluster centers
- recognition algorithm
- matching algorithm
- optimization algorithm
- high accuracy
- worst case
- computational cost
- computational complexity
- data points
- significant improvement
- tree structure
- k means
- graph matching
- objective function
- decision trees
- graph isomorphism