Pages that link to "Item:Q266791"
From MaRDI portal
The following pages link to An approximation algorithm for the longest cycle problem in solid grid graphs (Q266791):
Displayed 5 items.
- The Hamiltonian connectivity of rectangular supergrid graphs (Q1751246) (← links)
- The longest cycle problem is polynomial on interval graphs (Q2227488) (← links)
- An approximation algorithm for the longest path problem in solid grid graphs (Q2815541) (← links)
- Off-line exploration of rectangular cellular environments with a rectangular obstacle (Q5058395) (← links)
- Longest <i>(s, t)</i>-paths in <i>L</i>-shaped grid graphs (Q5379463) (← links)