A linear algorithm for double Roman domination of proper interval graphs.
Abolfazl PoureidiPublished in: Discret. Math. Algorithms Appl. (2020)
Keyphrases
- detection algorithm
- learning algorithm
- np hard
- k means
- computational cost
- experimental evaluation
- preprocessing
- search space
- dynamic programming
- cost function
- computational complexity
- times faster
- minimum spanning tree
- graph isomorphism
- optimization algorithm
- clustering method
- tree structure
- theoretical analysis
- expectation maximization
- linear programming
- optimal solution
- objective function
- simulated annealing
- worst case
- segmentation algorithm
- multi objective
- lower bound
- search algorithm
- matching algorithm
- convergence rate
- improved algorithm
- undirected graph
- image segmentation
- genetic algorithm