Pages that link to "Item:Q2960472"

The following pages link to A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs (Q2960472):

Displaying 15 items.

• Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
• An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs (Q626964) (← links)
• Linear algorithm for optimal path cover problem on interval graphs (Q911770) (← links)
• End vertices in interval graphs (Q1119662) (← links)
• The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649) (← links)
• 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)
• A linear‐time algorithm for the <i>k</i>‐fixed‐endpoint path cover problem on cographs (Q5434590) (← links)
• Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs (Q6167020) (← links)
• The \(k\)-th Roman domination problem is polynomial on interval graphs (Q6646735) (← links)
• Semi-proper interval graphs (Q6648246) (← links)