Pages that link to "Item:Q2581561"
From MaRDI portal
The following pages link to Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561):
Displaying 11 items.
- An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs (Q626964) (← links)
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
- Hamiltonian laceability of bubble-sort graphs with edge faults (Q881895) (← links)
- Kernelization and parameterized algorithms for covering a tree by a set of stars or paths (Q897955) (← links)
- Flow shop scheduling problem with conflict graphs (Q1708533) (← links)
- The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649) (← links)
- Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor (Q2434251) (← links)
- Path covering number and \(L(2,1)\)-labeling number of graphs (Q2446849) (← links)
- Computing and counting longest paths on circular-arc graphs in polynomial time (Q2448873) (← links)
- Finding a minimum path cover of a distance-hereditary graph in polynomial time (Q2457005) (← links)
- The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs (Q3507334) (← links)
