An algorithm for the secure total domination problem in proper interval graphs.
Toru ArakiYasufumi AitaPublished in: Theor. Comput. Sci. (2024)
Keyphrases
- dynamic programming
- optimization algorithm
- experimental evaluation
- objective function
- computational complexity
- learning algorithm
- theoretical analysis
- times faster
- high accuracy
- detection algorithm
- probabilistic model
- particle swarm optimization
- computational cost
- convergence rate
- highly efficient
- optimal solution
- similarity measure
- random graphs
- graph partitioning
- worst case
- significant improvement
- lower bound