Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars.
Ernst J. JoubertPublished in: Discret. Appl. Math. (2017)
Keyphrases
- detection algorithm
- experimental evaluation
- worst case
- computational cost
- learning algorithm
- optimization algorithm
- high accuracy
- dynamic programming
- preprocessing
- computational complexity
- improved algorithm
- np hard
- k means
- computationally efficient
- probabilistic model
- theoretical analysis
- times faster
- path planning
- convex hull
- recognition algorithm
- undirected graph
- segmentation algorithm
- cost function
- significant improvement
- objective function
- image segmentation