Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition.
Leonid BarenboimMichael ElkinPublished in: Distributed Comput. (2010)
Keyphrases
- decomposition algorithm
- cost function
- detection algorithm
- computational cost
- dynamic programming
- search space
- np hard
- gaussian graphical models
- optimization algorithm
- k means
- objective function
- computational complexity
- search algorithm
- expectation maximization
- segmentation algorithm
- multi agent
- clustering method
- decomposition method
- learning algorithm
- genetic algorithm