Pages that link to "Item:Q1401176"

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

Displaying 8 items.

• The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649) (← 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)
• Linear-time algorithm for the matched-domination problem in cographs (Q3101607) (← links)