A Graph Parameter That Matches the Resilience of the Certified Propagation Algorithm.
Chris LitsasAris PagourtzisDimitris SakavalasPublished in: ADHOC-NOW (2013)
Keyphrases
- graph based algorithm
- preprocessing
- learning algorithm
- graph structure
- k means
- experimental evaluation
- cost function
- expectation maximization
- convergence rate
- detection algorithm
- dynamic programming
- np hard
- similarity measure
- computational complexity
- optimal solution
- recognition algorithm
- wireless sensor networks
- search space
- worst case
- significant improvement
- clustering method
- ant colony optimization
- parameter space
- parameter settings
- spanning tree
- graph partitioning
- minimum spanning tree
- graph search
- maximum flow
- social networks