Algorithm and hardness results on hop domination in graphs.
Michael A. HenningSaikat PalDinabandhu PradhanPublished in: Inf. Process. Lett. (2020)
Keyphrases
- np hard
- computational complexity
- worst case
- learning algorithm
- preprocessing
- high accuracy
- detection algorithm
- optimization algorithm
- dynamic programming
- simulated annealing
- graph structure
- significant improvement
- search space
- computational cost
- convergence rate
- randomly generated
- optimal solution
- graph isomorphism
- weighted graph
- times faster
- genetic algorithm
- matching algorithm
- clustering method
- theoretical analysis
- probabilistic model
- experimental evaluation
- k means
- search algorithm
- social networks