On the complexity of exact algorithm for L(2, 1)-labeling of graphs.
Konstanty Junosza-SzaniawskiPawel RzazewskiPublished in: Inf. Process. Lett. (2011)
Keyphrases
- detection algorithm
- computational complexity
- worst case
- dynamic programming
- learning algorithm
- space complexity
- cost function
- np hard
- computational cost
- optimization algorithm
- active learning
- theoretical analysis
- experimental evaluation
- linear complexity
- segmentation algorithm
- matching algorithm
- graph structure
- objective function
- search algorithm
- brute force
- search space
- significant improvement
- minimum spanning tree
- clustering method
- error tolerance
- polynomial time complexity
- np complete
- graphical models
- simulated annealing
- high accuracy
- semi supervised
- probabilistic model
- k means
- evolutionary algorithm
- feature selection