On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs.

Elias Dahlhaus Péter Hajnal Marek Karpinski

Published in: J. Algorithms (1993)

Keyphrases

hamiltonian cycle
graph matching
traveling salesman problem
phase transition
graph coloring
space complexity
computational complexity
simulated annealing
genetic programming
markov chain
decision problems
satisfiability problem
graph model