Pages that link to "Item:Q2268855"
From MaRDI portal
The following pages link to A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs (Q2268855):
Displaying 12 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)
- Paired many-to-many disjoint path covers of hypertori (Q730480) (← links)
- The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649) (← links)
- Parameterized complexity of \((A,\ell)\)-path packing (Q2118381) (← links)
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph (Q2125230) (← links)
- A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs (Q2960472) (← links)
- Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs (Q5265335) (← links)
- A linear‐time algorithm for the <i>k</i>‐fixed‐endpoint path cover problem on cographs (Q5434590) (← links)
- Approximation algorithms for covering vertices by long paths (Q6586665) (← links)
- An approximation algorithm for covering vertices by \(4^+\)-paths (Q6606209) (← links)
- Semi-proper interval graphs (Q6648246) (← links)
