Pages that link to "Item:Q2448873"
From MaRDI portal
The following pages link to Computing and counting longest paths on circular-arc graphs in polynomial time (Q2448873):
Displaying 8 items.
- Detour trees (Q277622) (← links)
- Efficient reduction for path problems on circular-arc graphs (Q802884) (← links)
- The Hamiltonian connectivity of rectangular supergrid graphs (Q1751246) (← links)
- An approximation algorithm for computing longest paths. (Q1812006) (← links)
- The longest cycle problem is polynomial on interval graphs (Q2227488) (← links)
- A note on longest paths in circular arc graphs (Q2516667) (← links)
- Computing and counting longest paths on circular-arc graphs in polynomial time (Q2840712) (← links)
- Contracting to a longest path in H-free graphs (Q6065420) (← links)