Pages that link to "Item:Q765359"

The following pages link to A linear-time algorithm for the longest path problem in rectangular grid graphs (Q765359):

Displaying 17 items.

• An approximation algorithm for the longest cycle problem in solid grid graphs (Q266791) (← links)
• Hamiltonian cycles in linear-convex supergrid graphs (Q335338) (← links)
• Hamiltonian paths in some classes of grid graphs (Q442933) (← links)
• The Hamiltonian properties of supergrid graphs (Q497690) (← links)
• The Hamiltonian connectivity of rectangular supergrid graphs (Q1751246) (← 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)
• A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole (Q2399614) (← links)
• QUBO formulations of the longest path problem (Q2658047) (← links)
• An approximation algorithm for the longest path problem in solid grid graphs (Q2815541) (← links)
• Understanding chicken walks on <i>n</i> × <i>n</i> grid: Hamiltonian paths, discrete dynamics, and rectifiable paths (Q3467125) (← 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)
• Algorithms and complexity for geodetic sets on partial grids (Q6057850) (← links)
• (Q6065396) (← links)
• (Q6155870) (← links)
• The longest path problem in odd-sized \(O\)-shaped grid graphs (Q6492015) (← links)