Pages that link to "Item:Q4554952"

The following pages link to Linear Time Parameterized Algorithms for S <scp>ubset</scp> F <scp>eedback</scp> V <scp>ertex</scp> S <scp>et</scp> (Q4554952):

Displaying 8 items.

• A linear time algorithm for the minimum-weight feedback vertex set problem in series-parallel graphs (Q705040) (← links)
• Multi-budgeted directed cuts (Q786027) (← links)
• A parameterized complexity view on collapsing \(k\)-cores (Q825978) (← links)
• Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (Q5915760) (← links)
• An improved FPT algorithm for independent feedback vertex set (Q5918287) (← links)
• Subset feedback vertex set in chordal and split graphs (Q5919404) (← links)
• Improved FPT Algorithms for Deletion to Forest-Like Structures. (Q6065438) (← links)
• Improved FPT Algorithms for Deletion to Forest-Like Structures (Q6492092) (← links)