Pages that link to "Item:Q4820883"
From MaRDI portal
The following pages link to An approximation algorithm for finding long paths in Hamiltonian graphs (Q4820883):
Displaying 9 items.
- On approximating the longest path in a graph (Q679451) (← links)
- A successful algorithm for solving directed Hamiltonian path problems (Q788642) (← links)
- Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm (Q1198484) (← links)
- Finding long paths and cycles in sparse Hamiltonian graphs (Q3192021) (← links)
- (Q4213379) (← links)
- (Q4472488) (← links)
- (Q4952685) (← links)
- On approximating the longest path in a graph (Q5060133) (← links)
- Approximating long cycle above Dirac's guarantee (Q6586667) (← links)