Linear Time Algorithms for Happy Vertex Coloring Problems for Trees.
N. R. AravindSubrahmanyam KalyanasundaramAnjeneya Swami KarePublished in: IWOCA (2016)
Keyphrases
- benchmark problems
- optimization problems
- approximate solutions
- learning algorithm
- np hard problems
- hard problems
- specific problems
- problems in computer vision
- evolutionary algorithm
- data structure
- worst case
- np complete
- theoretical analysis
- difficult problems
- decision trees
- test problems
- heuristic methods
- related problems
- data sets
- minimum length
- computational problems
- linear space
- partial solutions
- combinatorial problems
- combinatorial optimization
- data mining algorithms
- computationally efficient
- data mining techniques
- optimal solution
- significant improvement