Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs.

Marek Karpinski Andrzej Rucinski Edyta Szymanska

Published in: LATIN (2010)

Keyphrases

hamiltonian cycle
computational complexity
traveling salesman problem
phase transition
graph coloring
np complete
special case
decision problems
neural network
np hard
machine learning
genetic algorithm
optimal solution
combinatorial optimization
combinatorial problems