Pages that link to "Item:Q2960472"
From MaRDI portal
The following pages link to A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs (Q2960472):
Displaying 7 items.
- A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs (Q2102897) (← links)
- Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs (Q2111523) (← links)
- Parameterized complexity of \((A,\ell)\)-path packing (Q2118381) (← links)
- A simple linear time algorithm to solve the MIST problem on interval graphs (Q2166762) (← links)
- The longest cycle problem is polynomial on interval graphs (Q2227488) (← links)
- Disjoint path covers joining prescribed source and sink sets in interval graphs (Q2419125) (← links)
- Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs (Q6167020) (← links)