Pages that link to "Item:Q1401176"

The following pages link to A time-optimal solution for the path cover problem on cographs. (Q1401176):

Displaying 20 items.

• An optimal parallel solution for the path cover problem on \(P_{4}\)-sparse graphs (Q868040) (← links)
• Optimal covering of cacti by vertex-disjoint paths (Q1178689) (← links)
• Optimal path cover problem on block graphs and bipartite permutation graphs (Q1261472) (← links)
• An optimal path cover algorithm for cographs (Q1903198) (← links)
• The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649) (← links)
• Computing directed Steiner path covers (Q2125222) (← links)
• Distance eigenvalues of a cograph and their multiplicities (Q2226412) (← links)
• A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs (Q2268855) (← links)
• Cographs: eigenvalues and Dilworth number (Q2317646) (← links)
• Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor (Q2434251) (← links)
• The Hamiltonian problem on distance-hereditary graphs (Q2489947) (← links)
• Efficient parallel recognition of cographs (Q2565857) (← links)
• LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs (Q2848201) (← links)
• A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs (Q2960472) (← links)
• Linear-time algorithm for the matched-domination problem in cographs (Q3101607) (← links)
• The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs (Q3507334) (← links)
• -cospectrality and -energy in cographs (Q4640076) (← links)
• Spectral properties of cographs and<i>P</i>₅-free graphs (Q4967261) (← links)
• A linear‐time algorithm for the <i>k</i>‐fixed‐endpoint path cover problem on cographs (Q5434590) (← links)
• Seidel matrices, Dilworth number and an eigenvalue-free interval for cographs (Q6592900) (← links)