The following pages link to Algorithms for long paths in graphs (Q884457):
Displaying 10 items.
- The longest path problem has a polynomial solution on interval graphs (Q639287) (← links)
- A linear-time algorithm for the longest path problem in rectangular grid graphs (Q765359) (← links)
- Algorithm for two disjoint long paths in 2-connected graphs (Q986559) (← links)
- The longest path problem is polynomial on cocomparability graphs (Q1939666) (← links)
- A genetic algorithm for the picture maze generation problem (Q2289933) (← links)
- Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs (Q2299983) (← links)
- The Longest Path Problem is Polynomial on Cocomparability Graphs (Q3057610) (← links)
- The Longest Path Problem Is Polynomial on Interval Graphs (Q3182942) (← links)
- Longest <i>(s, t)</i>-paths in <i>L</i>-shaped grid graphs (Q5379463) (← links)
- The longest path problem in odd-sized \(O\)-shaped grid graphs (Q6492015) (← links)
