A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs.
Beat GfellerElias VicariPublished in: PODC (2007)
Keyphrases
- independent set
- dynamic programming
- learning algorithm
- computational complexity
- objective function
- np hard
- k means
- distributed systems
- minimum spanning tree
- polynomial time complexity
- maximum weight
- graph structure
- directed graph
- matching algorithm
- segmentation algorithm
- np complete
- particle swarm optimization
- worst case