A fast distributed algorithm for (Δ + 1)-edge-coloring.
Anton BernshteynPublished in: J. Comb. Theory, Ser. B (2022)
Keyphrases
- learning algorithm
- np hard
- distributed systems
- computational cost
- significant improvement
- computational complexity
- optimal solution
- detection algorithm
- selection algorithm
- improved algorithm
- experimental evaluation
- high accuracy
- worst case
- times faster
- recognition algorithm
- computationally efficient
- tree structure
- probabilistic model
- similarity measure
- cost function
- k means
- edge linking
- segmentation method
- convergence rate
- ant colony optimization
- clustering method
- expectation maximization
- particle swarm optimization
- image registration
- preprocessing
- multi agent
- objective function
- image segmentation
- image processing