Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee.
Anja KisekSandi KlavzarPublished in: Inf. Process. Lett. (2021)
Keyphrases
- computational complexity
- times faster
- high accuracy
- cost function
- experimental evaluation
- recognition algorithm
- optimization algorithm
- learning algorithm
- dynamic programming
- space complexity
- np hard
- execution times
- improved algorithm
- memory requirements
- detection algorithm
- computational cost
- k means
- segmentation algorithm
- matching algorithm
- search space
- objective function
- highly efficient
- computational effort
- similarity measure
- expectation maximization
- particle swarm optimization
- undirected graph
- data sets