A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs.

Takao Asano Shunji Kikuchi Nobuji Saito

Published in: Discret. Appl. Math. (1984)

Keyphrases

dynamic programming
np hard
planar graphs
optimal solution
k means
expectation maximization
computational complexity
probabilistic model
graph structure