Pages that link to "Item:Q3467125"
From MaRDI portal
The following pages link to Understanding chicken walks on <i>n</i> × <i>n</i> grid: Hamiltonian paths, discrete dynamics, and rectifiable paths (Q3467125):
Displaying 4 items.
- Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs (Q2299983) (← links)
- A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole (Q2399614) (← links)
- Longest <i>(s, t)</i>-paths in <i>L</i>-shaped grid graphs (Q5379463) (← links)
- Hamiltonian paths in \(L\)-shaped grid graphs (Q5964021) (← links)