Pages that link to "Item:Q5434590"

The following pages link to A linear‐time algorithm for the <i>k</i>‐fixed‐endpoint path cover problem on cographs (Q5434590):

Displaying 5 items.

• An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs (Q626964) (← links)
• The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649) (← links)
• Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph (Q2125230) (← links)
• A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs (Q2268855) (← links)
• The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs (Q3507334) (← links)