On Hamiltonian paths in distance graphs.

Christian Löwenstein Dieter Rautenbach Friedrich Regen

Published in: Appl. Math. Lett. (2011)

Keyphrases

path length
distance function
graph matching
distance measure
structured objects
graph partitioning
graph model
graph structure
weighted graph
distance transform
euclidean distance
optimal path
small world
path finding
shortest path
graph clustering
series parallel
distance measurement
neural network