Algorithm and hardness results in double Roman domination of graphs.
Abolfazl PoureidiPublished in: Theor. Comput. Sci. (2022)
Keyphrases
- detection algorithm
- cost function
- np hard
- experimental evaluation
- computational complexity
- search space
- optimization algorithm
- worst case
- objective function
- graph isomorphism
- times faster
- segmentation algorithm
- expectation maximization
- dynamic programming
- computational cost
- k means
- similarity measure
- simulated annealing
- multi objective
- significant improvement
- tree structure
- data structure
- phase transition
- adjacency graph