Pages that link to "Item:Q3057610"
From MaRDI portal
The following pages link to The Longest Path Problem is Polynomial on Cocomparability Graphs (Q3057610):
Displaying 4 items.
- The longest cycle problem is polynomial on interval graphs (Q2227488) (← links)
- Computing and counting longest paths on circular-arc graphs in polynomial time (Q2448873) (← links)
- Computing and counting longest paths on circular-arc graphs in polynomial time (Q2840712) (← links)
- A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs (Q3078397) (← links)