An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem.
Xuzhen XieMutsunori YagiuraTakao OnoTomio HirataUri ZwickPublished in: J. Graph Algorithms Appl. (2008)
Keyphrases
- dynamic programming
- matching algorithm
- optimization algorithm
- detection algorithm
- learning algorithm
- optimal solution
- edge detection algorithm
- theoretical analysis
- high accuracy
- computational cost
- k means
- cost function
- edge detection
- linear programming
- particle swarm optimization
- computationally efficient
- segmentation algorithm
- preprocessing
- memory efficient
- improved algorithm
- genetic algorithm
- np hard
- gradient information
- interpolation method
- recognition algorithm
- image sequences
- tree structure
- clustering method
- computational complexity
- search space
- worst case
- experimental evaluation