Fast exact algorithm for L(2, 1)-labeling of graphs.
Konstanty Junosza-SzaniawskiJan KratochvílMathieu LiedloffPeter RossmanithPawel RzazewskiPublished in: Theor. Comput. Sci. (2013)
Keyphrases
- k means
- learning algorithm
- computational complexity
- experimental evaluation
- worst case
- times faster
- detection algorithm
- dynamic programming
- high accuracy
- simulated annealing
- significant improvement
- probabilistic relaxation
- graph structure
- recognition algorithm
- convergence rate
- objective function
- expectation maximization
- linear programming
- preprocessing
- cost function
- input data
- neural network
- feature selection
- lower bound
- np hard
- spanning tree
- undirected graph
- search space