A new and fast variant of the strict strong coloring based graph distribution algorithm.
Nousseiba GuidoumMeriem BensouyadDjamel-Eddine SaïdouniPublished in: SNPD (2015)
Keyphrases
- experimental evaluation
- high accuracy
- worst case
- cost function
- graph model
- objective function
- preprocessing
- dynamic programming
- np hard
- learning algorithm
- computational cost
- k means
- recognition algorithm
- graph structure
- graph search
- detection algorithm
- graph based algorithm
- probabilistic model
- optimization algorithm
- expectation maximization
- neural network
- random variables
- search space
- computational complexity
- similarity measure
- graph partitioning
- shortest path problem
- image segmentation
- social networks
- finding the shortest path