Pages that link to "Item:Q3507334"
From MaRDI portal
The following pages link to The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs (Q3507334):
Displaying 3 items.
- The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649) (← links)
- A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs (Q2960472) (← links)
- A linear‐time algorithm for the <i>k</i>‐fixed‐endpoint path cover problem on cographs (Q5434590) (← links)