Linear time algorithm for dominator chromatic number of trestled graphs.
S. ArumugamK. Raja ChandrasekarPublished in: Discret. Math. Algorithms Appl. (2019)
Keyphrases
- computational complexity
- detection algorithm
- memory requirements
- learning algorithm
- times faster
- preprocessing
- cost function
- worst case
- experimental evaluation
- significant improvement
- dynamic programming
- space complexity
- polynomial time complexity
- optimization algorithm
- decision trees
- convergence rate
- recognition algorithm
- undirected graph
- single scan
- expectation maximization
- computational cost
- color images
- k means
- objective function
- particle swarm optimization
- high accuracy
- upper bound
- probabilistic model
- np hard
- search space
- similarity measure