Pages that link to "Item:Q5915760"

The following pages link to Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (Q5915760):

Displaying 14 items.

• Computing weighted subset transversals in \(H\)-free graphs (Q832863) (← links)
• Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs (Q2136850) (← links)
• Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q2169982) (← links)
• Mim-width. II. The feedback vertex set problem (Q2285053) (← links)
• Subset feedback vertex set on graphs of bounded independent set size (Q2304562) (← links)
• (Q5009483) (← links)
• Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (Q5915760) (← links)
• (Q5915971) (redirect page) (← links)
• Computing subset transversals in \(H\)-free graphs (Q5918462) (← links)
• Node multiway cut and subset feedback vertex set on graphs of bounded mim-width (Q5970812) (← links)
• Parameterized complexity of multicut in weighted trees (Q6050131) (← links)
• A parameterized algorithm for subset feedback vertex set in tournaments (Q6076355) (← links)
• Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q6119835) (← links)
• Domination and Cut Problems on Chordal Graphs with Bounded Leafage (Q6492086) (← links)