A lower bound on the Hamiltonian path completion number of a line graph.

Paolo Detti Carlo Meloni Marco Pranzo

Published in: Appl. Math. Comput. (2013)

Keyphrases

lower bound
hamiltonian path
small number
upper bound
computational complexity
worst case
graph structure
neural network
objective function
structured data
graph model
maximum number
graph representation
constant factor