A Fully Dynamic Distributed Algorithm for a B-Coloring of Graphs.
Shuang LiuBrice EffantinHamamache KheddouciPublished in: ISPA (2008)
Keyphrases
- detection algorithm
- computational complexity
- high accuracy
- dynamic programming
- experimental evaluation
- objective function
- preprocessing
- cost function
- worst case
- learning algorithm
- times faster
- k means
- significant improvement
- similarity measure
- computational cost
- search space
- markov random field
- optimization algorithm
- data structure
- tree structure
- matching algorithm
- bayesian networks
- undirected graph
- graph partitioning