Pages that link to "Item:Q2361353"

The following pages link to Faster exact algorithms for some terminal set problems (Q2361353):

Displayed 7 items.

• 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)
• Computing subset transversals in \(H\)-free graphs (Q5918462) ‎ (← links)
• Subset feedback vertex set in chordal and split graphs (Q5919404) ‎ (← links)
• Node multiway cut and subset feedback vertex set on graphs of bounded mim-width (Q5970812) ‎ (← links)
• Exact and parameterized algorithms for restricted subset feedback vertex set in chordal graphs (Q6111961) ‎ (← links)