Polynomial-time algorithm for vertex k-colorability of P_5-free graphs

Marcin Kaminski Vadim V. Lozin

Published in: CoRR (2006)

Keyphrases

computational complexity
learning algorithm
cost function
hamiltonian cycle
worst case
dynamic programming
graph isomorphism
np hard
probabilistic model
phase transition
objective function
optimal solution
preprocessing
computational cost
optimization algorithm
adjacency graph