Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs.

Frank Göring Jochen Harant

Published in: Discret. Math. (2010)

Keyphrases

planar graphs
weighted graph
undirected graph
minimum weight
approximate inference
graphical models
directed graph
pairwise
random walk
spanning tree
image segmentation
probabilistic model
connected components
edge map