The smallest hard-to-color graph for the SL algorithm.
Marek KubaleJaroslaw PakulskiKonrad PiwakowskiPublished in: Discret. Math. (1997)
Keyphrases
- dynamic programming
- computational complexity
- graph structure
- dominating set
- cost function
- detection algorithm
- learning algorithm
- optimization algorithm
- recognition algorithm
- probabilistic model
- minimum spanning tree
- color constancy
- graph search
- graph based algorithm
- expectation maximization
- matching algorithm
- tree structure
- optimal solution
- objective function
- particle swarm optimization
- simulated annealing
- computational cost
- np hard
- color images
- preprocessing
- shortest path problem
- gradient information
- maximum flow
- similarity measure
- polynomial time complexity
- social networks