The following pages link to (Q4472488):
Displaying 5 items.
- An efficient algorithm for the length-constrained heaviest path problem on a tree (Q294615) (← links)
- A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. (Q1427178) (← links)
- An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance (Q1670106) (← links)
- Local search algorithms for finding the Hamiltonian completion number of line graphs (Q2468757) (← links)
- The approximability of the weighted Hamiltonian path completion problem on a tree (Q2566021) (← links)
