Pages that link to "Item:Q3182942"
From MaRDI portal
The following pages link to The Longest Path Problem Is Polynomial on Interval Graphs (Q3182942):
Displaying 10 items.
- An approximation algorithm for the longest cycle problem in solid grid graphs (Q266791) (← links)
- A linear-time algorithm for the longest path problem in rectangular grid graphs (Q765359) (← links)
- The longest cycle problem is polynomial on interval graphs (Q2227488) (← links)
- A genetic algorithm for the picture maze generation problem (Q2289933) (← links)
- Sitting closer to friends than enemies, revisited (Q2345988) (← links)
- The Longest Path Problem is Polynomial on Cocomparability Graphs (Q3057610) (← links)
- A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs (Q3078397) (← links)
- Longest <i>(s, t)</i>-paths in <i>L</i>-shaped grid graphs (Q5379463) (← links)
- Tropical paths in vertex-colored graphs (Q5918388) (← links)
- The longest path problem in odd-sized \(O\)-shaped grid graphs (Q6492015) (← links)