The following pages link to (Q2921667):
Displaying 10 items.
- An approximation algorithm for the longest cycle problem in solid grid graphs (Q266791) (← links)
- On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
- The longest path problem has a polynomial solution on interval graphs (Q639287) (← links)
- A linear-time algorithm for the longest path problem in rectangular grid graphs (Q765359) (← links)
- Not being (super)thin or solid is hard: A study of grid Hamiltonicity (Q924074) (← links)
- Algorithm engineering for color-coding with applications to signaling pathway detection (Q958201) (← links)
- Approximating the maximum clique minor and some subgraph homeomorphism problems (Q1022596) (← links)
- On a simple randomized algorithm for finding a 2-factor in sparse graphs (Q1041775) (← links)
- The Longest Path Problem is Polynomial on Cocomparability Graphs (Q3057610) (← links)
- The Longest Path Problem Is Polynomial on Interval Graphs (Q3182942) (← links)
