2-local 4/3-competitive algorithm for multicoloring hexagonal graphs.
Petra SparlJanez ZerovnikPublished in: J. Algorithms (2005)
Keyphrases
- times faster
- dynamic programming
- optimization algorithm
- significant improvement
- worst case
- computational cost
- graph structure
- matching algorithm
- detection algorithm
- high accuracy
- np hard
- learning algorithm
- cost function
- computational complexity
- experimental evaluation
- k means
- optimal solution
- recognition algorithm
- graphical models
- particle swarm optimization
- search space
- image processing
- neural network
- minimum spanning tree
- graph clustering
- graph isomorphism
- max cut