Pages that link to "Item:Q4962189"
From MaRDI portal
The following pages link to Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable (Q4962189):
Displaying 13 items.
- Kernels for deletion to classes of acyclic digraphs (Q1678165) (← links)
- FPT algorithms for generalized feedback vertex set problems (Q2110739) (← links)
- Towards a polynomial kernel for directed feedback vertex set (Q2663705) (← links)
- Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
- Fixed parameterized algorithms for generalized feedback vertex set problems (Q2693637) (← links)
- Odd Multiway Cut in Directed Acyclic Graphs (Q3300762) (← links)
- (Q5089249) (← links)
- Parameterized complexity of multicut in weighted trees (Q6050131) (← links)
- A parameterized algorithm for subset feedback vertex set in tournaments (Q6076355) (← links)
- Recognizing when a preference system is close to admitting a master list (Q6124592) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- On Weighted Graph Separation Problems and Flow Augmentation (Q6187079) (← links)
- Domination and Cut Problems on Chordal Graphs with Bounded Leafage (Q6492086) (← links)
