Pages that link to "Item:Q2468757"
From MaRDI portal
The following pages link to Local search algorithms for finding the Hamiltonian completion number of line graphs (Q2468757):
Displaying 5 items.
- A lower bound on the Hamiltonian path completion number of a line graph (Q902504) (← links)
- A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. (Q1427178) (← links)
- A linear algorithm for the Hamiltonian completion number of the line graph of a tree (Q1603430) (← links)
- Evolving test instances of the Hamiltonian completion problem (Q2108108) (← links)
- Evolutionary operators for the Hamiltonian completion problem (Q2156924) (← links)