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 4 items.
- The Hamiltonian connectivity of rectangular supergrid graphs (Q1751246) (← 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)
- Unit-length rectangular drawings of graphs (Q6117041) (← links)