The following pages link to (Q4952685):
Displaying 14 items.
- The longest path problem has a polynomial solution on interval graphs (Q639287) (← links)
- On approximating the longest path in a graph (Q679451) (← links)
- A successful algorithm for solving directed Hamiltonian path problems (Q788642) (← links)
- Algorithms for long paths in graphs (Q884457) (← links)
- Algorithm for two disjoint long paths in 2-connected graphs (Q986559) (← links)
- Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm (Q1198484) (← links)
- The longest path problem is polynomial on cocomparability graphs (Q1939666) (← links)
- The Longest Path Problem Is Polynomial on Interval Graphs (Q3182942) (← links)
- Finding long paths and cycles in sparse Hamiltonian graphs (Q3192021) (← links)
- (Q3644697) (← links)
- (Q4213379) (← links)
- (Q4472488) (← links)
- An approximation algorithm for finding long paths in Hamiltonian graphs (Q4820883) (← links)
- On approximating the longest path in a graph (Q5060133) (← links)
