A self-stabilizing distributed algorithm for edge-coloring general graphs.
Pranay ChaudhuriHussein ThompsonPublished in: Australas. J Comb. (2007)
Keyphrases
- objective function
- special case
- preprocessing
- np hard
- cost function
- detection algorithm
- weighted graph
- computational complexity
- k means
- multi agent
- graph structure
- significant improvement
- computational cost
- recognition algorithm
- polynomial time complexity
- edge points
- adjacency graph
- image processing
- convergence rate
- matching algorithm
- expectation maximization
- worst case
- search space
- similarity measure