Pages that link to "Item:Q2815541"
From MaRDI portal
The following pages link to An approximation algorithm for the longest path problem in solid grid graphs (Q2815541):
Displaying 11 items.
- An approximation algorithm for the longest cycle problem in solid grid graphs (Q266791) (← links)
- Approximating the longest paths in grid graphs (Q719276) (← links)
- Longest-edge \(n\)-section algorithms: properties and open problems (Q747921) (← links)
- A linear-time algorithm for the longest path problem in rectangular grid graphs (Q765359) (← links)
- The Hamiltonian connectivity of rectangular supergrid graphs (Q1751246) (← links)
- On exact solution approaches for the longest induced path problem (Q1999389) (← links)
- Off-line exploration of rectangular cellular environments with a rectangular obstacle (Q5058395) (← links)
- On approximating the longest path in a graph (Q5060133) (← 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)
- Hamiltonian (s, t)-paths in solid supergrid graphs (Q6495481) (← links)
