An Algorithm to Find Two Distance Domination Parameters in a Graph.
Gerd FrickeMichael A. HenningOrtrud OellermannHenda C. SwartPublished in: Discret. Appl. Math. (1996)
Keyphrases
- expectation maximization
- learning algorithm
- simulated annealing
- optimization algorithm
- preprocessing
- dynamic programming
- maximum flow
- matching algorithm
- computational complexity
- objective function
- graph structure
- search space
- cost function
- np hard
- computational cost
- graph based algorithm
- euclidean distance
- dominating set
- tree structure
- distance metric
- graph model
- parameter tuning
- optimal parameters
- em algorithm
- particle swarm optimization
- k means
- shortest path problem
- levenberg marquardt
- polynomial time complexity
- parameter estimation
- graph theory
- distance transform
- distance function
- clustering method
- shortest path
- random walk
- input data
- worst case
- association rules
- optimal solution
- similarity measure