Sign in

Local search algorithms for finding the Hamiltonian completion number of line graphs.

Paolo DettiCarlo MeloniMarco Pranzo
Published in: Ann. Oper. Res. (2007)
Keyphrases
  • search algorithm
  • small number
  • line segments
  • computational complexity
  • data sets
  • similarity measure
  • search space
  • metaheuristic
  • memory requirements
  • graph search