Pages that link to "Item:Q2944523"
From MaRDI portal
The following pages link to Faster fixed parameter tractable algorithms for finding feedback vertex sets (Q2944523):
Displayed 22 items.
- On group feedback vertex set parameterized by the size of the cutset (Q262251) (← links)
- Enumerating minimal subset feedback vertex sets (Q472481) (← links)
- On feedback vertex set: new measure and new structures (Q494933) (← links)
- Extremal properties of the bipartite vertex frustration of graphs (Q654182) (← links)
- Improved algorithms for feedback vertex set problems (Q955350) (← links)
- Parameterizing above or below guaranteed values (Q1004602) (← links)
- Kernels for deletion to classes of acyclic digraphs (Q1678165) (← links)
- New formulae for the bipartite vertex frustration and decycling number of graphs (Q2008493) (← links)
- Faster deterministic \textsc{Feedback Vertex Set} (Q2015151) (← links)
- Mim-width. II. The feedback vertex set problem (Q2285053) (← links)
- Parameterised algorithms for deletion to classes of DAGs (Q2322699) (← links)
- An improved parameterized algorithm for the independent feedback vertex set problem (Q2447761) (← links)
- Towards a polynomial kernel for directed feedback vertex set (Q2663705) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- Subset Feedback Vertex Set Is Fixed-Parameter Tractable (Q3012825) (← links)
- A Quartic Kernel for Pathwidth-One Vertex Deletion (Q3057625) (← links)
- (Q3304141) (← links)
- Linear Time Parameterized Algorithms for Subset Feedback Vertex Set (Q3448850) (← links)
- FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters (Q4632216) (← links)
- (Q5111250) (← links)
- (Q5140722) (← links)
- Packing Cycles Faster Than Erdos--Posa (Q5232148) (← links)